./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/duplets.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_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/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_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/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_401d8f42-225f-4c39-986a-f2c9dd89d99d/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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:39:44,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:39:44,669 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:39:44,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:39:44,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:39:44,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:39:44,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:39:44,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:39:44,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:39:44,701 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:39:44,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:39:44,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:39:44,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:39:44,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:39:44,703 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:39:44,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:39:44,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:39:44,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:39:44,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:39:44,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:39:44,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:39:44,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:39:44,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:39:44,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:39:44,708 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:39:44,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:39:44,709 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:39:44,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:39:44,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:39:44,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:39:44,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:39:44,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:39:44,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:39:44,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:39:44,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:39:44,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:39:44,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:39:44,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:39:44,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:39:44,712 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:39:44,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:39:44,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:39:44,713 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/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_401d8f42-225f-4c39-986a-f2c9dd89d99d/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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2023-11-29 05:39:44,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:39:44,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:39:44,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:39:44,966 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:39:44,966 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:39:44,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/verifythis/duplets.c [2023-11-29 05:39:47,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:39:47,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:39:47,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c [2023-11-29 05:39:47,865 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/8341963ad/a7c16a90bf414fd2b086374c592369e1/FLAG1cbf3a726 [2023-11-29 05:39:47,877 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/8341963ad/a7c16a90bf414fd2b086374c592369e1 [2023-11-29 05:39:47,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:39:47,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:39:47,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:39:47,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:39:47,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:39:47,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:39:47" (1/1) ... [2023-11-29 05:39:47,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68736232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:47, skipping insertion in model container [2023-11-29 05:39:47,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:39:47" (1/1) ... [2023-11-29 05:39:47,907 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:39:48,024 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c[485,498] [2023-11-29 05:39:48,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:39:48,059 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:39:48,069 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c[485,498] [2023-11-29 05:39:48,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:39:48,095 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:39:48,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48 WrapperNode [2023-11-29 05:39:48,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:39:48,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:39:48,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:39:48,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:39:48,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,139 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-29 05:39:48,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:39:48,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:39:48,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:39:48,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:39:48,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,168 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2023-11-29 05:39:48,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:39:48,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:39:48,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:39:48,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:39:48,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (1/1) ... [2023-11-29 05:39:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:39:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:48,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:39:48,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:39:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:39:48,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:39:48,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:39:48,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:39:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:39:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:39:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:39:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:39:48,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:39:48,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:39:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:39:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:39:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:39:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:39:48,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:39:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:39:48,359 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:39:48,362 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:39:48,548 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:39:48,585 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:39:48,585 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:39:48,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:39:48 BoogieIcfgContainer [2023-11-29 05:39:48,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:39:48,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:39:48,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:39:48,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:39:48,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:39:47" (1/3) ... [2023-11-29 05:39:48,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669f7cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:39:48, skipping insertion in model container [2023-11-29 05:39:48,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:39:48" (2/3) ... [2023-11-29 05:39:48,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669f7cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:39:48, skipping insertion in model container [2023-11-29 05:39:48,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:39:48" (3/3) ... [2023-11-29 05:39:48,595 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2023-11-29 05:39:48,613 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:39:48,613 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:39:48,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:39:48,667 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;@752737c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:39:48,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:39:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:39:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 05:39:48,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:48,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:48,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:48,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash -633346845, now seen corresponding path program 1 times [2023-11-29 05:39:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016583255] [2023-11-29 05:39:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016583255] [2023-11-29 05:39:48,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016583255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:48,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:39:48,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298783775] [2023-11-29 05:39:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:48,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:39:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:48,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:39:48,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:39:48,923 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:39:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:48,960 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2023-11-29 05:39:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:39:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-29 05:39:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:48,969 INFO L225 Difference]: With dead ends: 70 [2023-11-29 05:39:48,970 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 05:39:48,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 05:39:48,977 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:48,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:39:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 05:39:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 05:39:49,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:39:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-29 05:39:49,018 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 30 [2023-11-29 05:39:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:49,019 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 05:39:49,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:39:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-29 05:39:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 05:39:49,021 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:49,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:49,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:39:49,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:49,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1840136240, now seen corresponding path program 1 times [2023-11-29 05:39:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806701688] [2023-11-29 05:39:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:39:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806701688] [2023-11-29 05:39:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806701688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:49,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847019025] [2023-11-29 05:39:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:49,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:49,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:39:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:49,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:39:49,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:39:49,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:39:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847019025] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:49,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-29 05:39:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369554916] [2023-11-29 05:39:49,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:49,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:39:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:39:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:39:49,803 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:39:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:49,972 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-11-29 05:39:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:39:49,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-29 05:39:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:49,974 INFO L225 Difference]: With dead ends: 59 [2023-11-29 05:39:49,974 INFO L226 Difference]: Without dead ends: 40 [2023-11-29 05:39:49,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:39:49,977 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:49,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-29 05:39:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2023-11-29 05:39:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:39:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 05:39:49,986 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 30 [2023-11-29 05:39:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:49,988 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 05:39:49,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:39:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 05:39:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:39:49,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:49,990 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:49,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 05:39:50,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:50,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:50,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1407409120, now seen corresponding path program 1 times [2023-11-29 05:39:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:50,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167062793] [2023-11-29 05:39:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167062793] [2023-11-29 05:39:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167062793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:50,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:50,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:39:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643138894] [2023-11-29 05:39:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:50,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:39:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:50,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:39:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:39:50,299 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:50,368 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-11-29 05:39:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:39:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-29 05:39:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:50,370 INFO L225 Difference]: With dead ends: 53 [2023-11-29 05:39:50,370 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 05:39:50,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:39:50,372 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:50,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:39:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 05:39:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2023-11-29 05:39:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:39:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-29 05:39:50,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 31 [2023-11-29 05:39:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:50,384 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-29 05:39:50,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-29 05:39:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:39:50,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:50,386 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:50,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:39:50,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:50,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 449686045, now seen corresponding path program 1 times [2023-11-29 05:39:50,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:50,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342804439] [2023-11-29 05:39:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:39:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:50,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342804439] [2023-11-29 05:39:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342804439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:50,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:50,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:39:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998215026] [2023-11-29 05:39:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:39:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:50,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:39:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:39:50,890 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:39:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:51,151 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2023-11-29 05:39:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:39:51,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-29 05:39:51,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:51,154 INFO L225 Difference]: With dead ends: 75 [2023-11-29 05:39:51,155 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 05:39:51,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:39:51,156 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 226 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 05:39:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-29 05:39:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:39:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-11-29 05:39:51,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2023-11-29 05:39:51,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:51,168 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-29 05:39:51,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:39:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-11-29 05:39:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:39:51,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:51,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:51,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:39:51,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:51,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:51,170 INFO L85 PathProgramCache]: Analyzing trace with hash -320162031, now seen corresponding path program 1 times [2023-11-29 05:39:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782994098] [2023-11-29 05:39:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782994098] [2023-11-29 05:39:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782994098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327044664] [2023-11-29 05:39:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:51,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:51,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:51,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:39:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:51,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:39:51,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:51,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327044664] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:51,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-29 05:39:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887385265] [2023-11-29 05:39:51,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:51,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:39:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:39:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:39:51,443 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:51,503 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2023-11-29 05:39:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:39:51,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-11-29 05:39:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:51,505 INFO L225 Difference]: With dead ends: 64 [2023-11-29 05:39:51,506 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 05:39:51,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:39:51,507 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:51,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:39:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 05:39:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-29 05:39:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:39:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2023-11-29 05:39:51,519 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 35 [2023-11-29 05:39:51,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:51,519 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2023-11-29 05:39:51,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2023-11-29 05:39:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:39:51,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:51,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:51,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:39:51,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:51,726 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:51,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 9167953, now seen corresponding path program 1 times [2023-11-29 05:39:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491515625] [2023-11-29 05:39:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:39:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:52,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:52,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491515625] [2023-11-29 05:39:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491515625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:52,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:39:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755036681] [2023-11-29 05:39:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:39:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:39:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:39:52,039 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:39:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:52,282 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2023-11-29 05:39:52,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:39:52,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 05:39:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:52,284 INFO L225 Difference]: With dead ends: 78 [2023-11-29 05:39:52,284 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 05:39:52,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:39:52,286 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:52,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 244 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 05:39:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2023-11-29 05:39:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:39:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-11-29 05:39:52,299 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 38 [2023-11-29 05:39:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:52,299 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-11-29 05:39:52,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:39:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-11-29 05:39:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:39:52,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:52,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:52,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:39:52,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:52,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 161144636, now seen corresponding path program 2 times [2023-11-29 05:39:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:52,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347763454] [2023-11-29 05:39:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:52,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:53,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:53,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:39:53,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347763454] [2023-11-29 05:39:53,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347763454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:53,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382719377] [2023-11-29 05:39:53,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:39:53,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:53,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:53,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:39:53,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:39:53,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:53,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 05:39:53,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:53,523 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 05:39:53,524 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 1 case distinctions, treesize of input 38 treesize of output 19 [2023-11-29 05:39:53,775 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-29 05:39:53,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2023-11-29 05:39:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:39:54,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:54,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:39:54,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 515 treesize of output 447 [2023-11-29 05:39:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:39:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382719377] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:57,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2023-11-29 05:39:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728501379] [2023-11-29 05:39:57,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:57,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 05:39:57,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 05:39:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:39:57,288 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 29 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 05:39:57,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:57,952 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2023-11-29 05:39:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:39:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2023-11-29 05:39:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:57,956 INFO L225 Difference]: With dead ends: 94 [2023-11-29 05:39:57,956 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 05:39:57,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 05:39:57,958 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:57,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 421 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:39:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 05:39:57,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2023-11-29 05:39:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:39:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2023-11-29 05:39:57,970 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 38 [2023-11-29 05:39:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:57,970 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2023-11-29 05:39:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 05:39:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2023-11-29 05:39:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-29 05:39:57,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:57,972 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:57,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:39:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:58,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:58,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash 472107720, now seen corresponding path program 3 times [2023-11-29 05:39:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022753705] [2023-11-29 05:39:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:58,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022753705] [2023-11-29 05:39:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022753705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152888517] [2023-11-29 05:39:58,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:39:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:58,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:58,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:39:58,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:39:58,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:39:58,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:39:58,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:58,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:39:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152888517] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:39:58,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:39:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2023-11-29 05:39:58,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295399920] [2023-11-29 05:39:58,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:58,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:39:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:58,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:39:58,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:39:58,473 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:58,584 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2023-11-29 05:39:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:39:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2023-11-29 05:39:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:58,586 INFO L225 Difference]: With dead ends: 97 [2023-11-29 05:39:58,586 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 05:39:58,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:39:58,587 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:58,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 05:39:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-29 05:39:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:39:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2023-11-29 05:39:58,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 40 [2023-11-29 05:39:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:58,603 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2023-11-29 05:39:58,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:39:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2023-11-29 05:39:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:39:58,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:58,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:58,610 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:39:58,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 05:39:58,810 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:58,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 956566272, now seen corresponding path program 1 times [2023-11-29 05:39:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:58,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465737799] [2023-11-29 05:39:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:39:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:39:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:39:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465737799] [2023-11-29 05:39:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465737799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:39:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854953664] [2023-11-29 05:39:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:59,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:39:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:39:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:39:59,090 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:39:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:59,229 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2023-11-29 05:39:59,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:39:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 05:39:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:59,230 INFO L225 Difference]: With dead ends: 81 [2023-11-29 05:39:59,231 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 05:39:59,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:39:59,231 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:59,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 05:39:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2023-11-29 05:39:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:39:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2023-11-29 05:39:59,245 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 45 [2023-11-29 05:39:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:59,245 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2023-11-29 05:39:59,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:39:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2023-11-29 05:39:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:39:59,247 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:59,247 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:59,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:39:59,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:59,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 958413314, now seen corresponding path program 1 times [2023-11-29 05:39:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990133901] [2023-11-29 05:39:59,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:39:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:39:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:39:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:59,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990133901] [2023-11-29 05:39:59,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990133901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:59,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:39:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148735976] [2023-11-29 05:39:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:59,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:39:59,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:39:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:39:59,442 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:39:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:59,528 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2023-11-29 05:39:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:39:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 05:39:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:59,530 INFO L225 Difference]: With dead ends: 92 [2023-11-29 05:39:59,530 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 05:39:59,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:39:59,531 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:59,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:39:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 05:39:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2023-11-29 05:39:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 57 states have internal predecessors, (69), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:39:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2023-11-29 05:39:59,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 45 [2023-11-29 05:39:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:59,545 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2023-11-29 05:39:59,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:39:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2023-11-29 05:39:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:39:59,546 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:59,546 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:39:59,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:39:59,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:59,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 601257606, now seen corresponding path program 1 times [2023-11-29 05:39:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399662742] [2023-11-29 05:39:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:59,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:39:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:39:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:39:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:39:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-29 05:39:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399662742] [2023-11-29 05:39:59,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399662742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908634732] [2023-11-29 05:39:59,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:39:59,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:39:59,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:39:59,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:39:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:59,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:39:59,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:00,145 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 1 [2023-11-29 05:40:00,242 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 17 treesize of output 9 [2023-11-29 05:40:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:40:00,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:00,385 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 28 treesize of output 24 [2023-11-29 05:40:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:40:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908634732] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:40:00,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:40:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 28 [2023-11-29 05:40:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437596663] [2023-11-29 05:40:00,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:40:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 05:40:00,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 05:40:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2023-11-29 05:40:00,560 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:40:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:01,120 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-11-29 05:40:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:40:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2023-11-29 05:40:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:01,122 INFO L225 Difference]: With dead ends: 90 [2023-11-29 05:40:01,122 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 05:40:01,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 05:40:01,124 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 67 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:01,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 318 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:40:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 05:40:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2023-11-29 05:40:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 62 states have internal predecessors, (72), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:40:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2023-11-29 05:40:01,136 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 45 [2023-11-29 05:40:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:01,137 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2023-11-29 05:40:01,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 05:40:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2023-11-29 05:40:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:40:01,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:01,138 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:01,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:40:01,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:01,338 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:01,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 603104648, now seen corresponding path program 1 times [2023-11-29 05:40:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089844952] [2023-11-29 05:40:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:40:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089844952] [2023-11-29 05:40:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089844952] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604984321] [2023-11-29 05:40:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:01,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:01,488 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:40:01,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:40:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:01,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:40:01,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:01,696 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 1 [2023-11-29 05:40:01,750 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 15 treesize of output 7 [2023-11-29 05:40:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:40:01,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:40:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604984321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:01,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:40:01,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10 [2023-11-29 05:40:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305892768] [2023-11-29 05:40:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:01,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:40:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:40:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:40:01,756 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:40:06,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:40:10,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:40:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:10,692 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2023-11-29 05:40:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:40:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-11-29 05:40:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:10,693 INFO L225 Difference]: With dead ends: 124 [2023-11-29 05:40:10,693 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 05:40:10,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:40:10,694 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 176 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 8.9s Time] [2023-11-29 05:40:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 05:40:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2023-11-29 05:40:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 77 states have internal predecessors, (86), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:40:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2023-11-29 05:40:10,709 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 45 [2023-11-29 05:40:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:10,709 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2023-11-29 05:40:10,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:40:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2023-11-29 05:40:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:40:10,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:10,710 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:10,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:40:10,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:10,910 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:10,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash 753234289, now seen corresponding path program 4 times [2023-11-29 05:40:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968130886] [2023-11-29 05:40:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:10,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:12,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 05:40:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968130886] [2023-11-29 05:40:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968130886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203866468] [2023-11-29 05:40:12,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:40:12,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:12,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:12,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:40:12,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:40:13,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:40:13,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:40:13,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 05:40:13,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:13,032 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 7 treesize of output 6 [2023-11-29 05:40:13,280 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 45 treesize of output 40 [2023-11-29 05:40:13,853 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 75 treesize of output 57 [2023-11-29 05:40:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:40:13,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203866468] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:14,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:40:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-29 05:40:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780033931] [2023-11-29 05:40:14,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:40:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 05:40:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:40:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:40:14,587 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:40:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:15,709 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2023-11-29 05:40:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:40:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2023-11-29 05:40:15,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:15,710 INFO L225 Difference]: With dead ends: 152 [2023-11-29 05:40:15,710 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:40:15,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 05:40:15,712 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:15,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 443 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:40:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:40:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-29 05:40:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 61 states have internal predecessors, (64), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:40:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-29 05:40:15,722 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 45 [2023-11-29 05:40:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:15,722 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-29 05:40:15,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:40:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-29 05:40:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:40:15,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:15,723 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:15,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:40:15,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:15,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:15,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1531281429, now seen corresponding path program 1 times [2023-11-29 05:40:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38440893] [2023-11-29 05:40:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:40:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:40:16,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:16,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38440893] [2023-11-29 05:40:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38440893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:40:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900551296] [2023-11-29 05:40:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:16,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:40:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:40:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:40:16,231 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:40:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:16,404 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-11-29 05:40:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:40:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2023-11-29 05:40:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:16,405 INFO L225 Difference]: With dead ends: 90 [2023-11-29 05:40:16,405 INFO L226 Difference]: Without dead ends: 86 [2023-11-29 05:40:16,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:40:16,406 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:16,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-29 05:40:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-29 05:40:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:40:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-11-29 05:40:16,420 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2023-11-29 05:40:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:16,421 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-11-29 05:40:16,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:40:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-11-29 05:40:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 05:40:16,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:16,422 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:16,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:40:16,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:16,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1681149395, now seen corresponding path program 1 times [2023-11-29 05:40:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267689445] [2023-11-29 05:40:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 05:40:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267689445] [2023-11-29 05:40:16,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267689445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075557513] [2023-11-29 05:40:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:16,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:16,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:40:16,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:40:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:16,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:40:16,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:16,844 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 1 [2023-11-29 05:40:16,963 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 15 treesize of output 7 [2023-11-29 05:40:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 05:40:16,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:16,999 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 32 treesize of output 28 [2023-11-29 05:40:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 05:40:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075557513] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:40:17,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:40:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2023-11-29 05:40:17,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336255674] [2023-11-29 05:40:17,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:40:17,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:40:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:40:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:40:17,111 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:40:21,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:40:25,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:40:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:26,048 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-11-29 05:40:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:40:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 52 [2023-11-29 05:40:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:26,050 INFO L225 Difference]: With dead ends: 98 [2023-11-29 05:40:26,050 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 05:40:26,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:40:26,051 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:26,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 324 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 05:40:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 05:40:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-11-29 05:40:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 05:40:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-11-29 05:40:26,066 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 52 [2023-11-29 05:40:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:26,066 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-11-29 05:40:26,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:40:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-11-29 05:40:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:40:26,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:26,067 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:26,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:40:26,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:26,268 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:26,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -710336108, now seen corresponding path program 1 times [2023-11-29 05:40:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972767645] [2023-11-29 05:40:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:40:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:40:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 05:40:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972767645] [2023-11-29 05:40:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972767645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:40:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655377827] [2023-11-29 05:40:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:40:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:40:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:40:26,795 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:40:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:27,014 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-29 05:40:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:40:27,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2023-11-29 05:40:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:27,016 INFO L225 Difference]: With dead ends: 87 [2023-11-29 05:40:27,016 INFO L226 Difference]: Without dead ends: 55 [2023-11-29 05:40:27,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:40:27,017 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:27,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 118 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-29 05:40:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-29 05:40:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:40:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2023-11-29 05:40:27,029 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 57 [2023-11-29 05:40:27,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:27,029 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2023-11-29 05:40:27,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:40:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2023-11-29 05:40:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 05:40:27,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:27,030 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:27,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:40:27,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:27,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash -375919658, now seen corresponding path program 1 times [2023-11-29 05:40:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450430312] [2023-11-29 05:40:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:40:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 05:40:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450430312] [2023-11-29 05:40:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450430312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:40:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594437336] [2023-11-29 05:40:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:27,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:40:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:40:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:40:27,312 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:40:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:27,428 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2023-11-29 05:40:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:40:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-11-29 05:40:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:27,430 INFO L225 Difference]: With dead ends: 61 [2023-11-29 05:40:27,430 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 05:40:27,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:40:27,431 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:27,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:40:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 05:40:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 05:40:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:40:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2023-11-29 05:40:27,442 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 58 [2023-11-29 05:40:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:27,443 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2023-11-29 05:40:27,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:40:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2023-11-29 05:40:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 05:40:27,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:27,444 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:27,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:40:27,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:27,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash 182628671, now seen corresponding path program 1 times [2023-11-29 05:40:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433577070] [2023-11-29 05:40:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:40:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 05:40:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:40:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:40:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 05:40:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:40:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:40:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 05:40:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433577070] [2023-11-29 05:40:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433577070] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013586179] [2023-11-29 05:40:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:40:27,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:40:27,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:40:27,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:40:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:28,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 05:40:28,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:28,102 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 7 treesize of output 6 [2023-11-29 05:40:28,255 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 45 treesize of output 40 [2023-11-29 05:40:29,216 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 17 treesize of output 13 [2023-11-29 05:40:29,225 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 1 [2023-11-29 05:40:52,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:52,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2023-11-29 05:40:52,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:52,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 124 [2023-11-29 05:40:52,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:40:52,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 156 [2023-11-29 05:40:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 05:40:52,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:53,293 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 84 treesize of output 80 [2023-11-29 05:40:53,297 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 138 treesize of output 130 [2023-11-29 05:41:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-29 05:41:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013586179] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:41:26,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:41:26,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 19] total 42 [2023-11-29 05:41:26,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965804829] [2023-11-29 05:41:26,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:41:26,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-29 05:41:26,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:26,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-29 05:41:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1491, Unknown=7, NotChecked=0, Total=1722 [2023-11-29 05:41:26,190 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 42 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 9 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-29 05:41:35,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:41:44,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:41:49,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:41:53,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:06,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:42:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:06,461 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2023-11-29 05:42:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:42:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 9 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) Word has length 64 [2023-11-29 05:42:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:06,462 INFO L225 Difference]: With dead ends: 58 [2023-11-29 05:42:06,463 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 05:42:06,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=504, Invalid=3025, Unknown=11, NotChecked=0, Total=3540 [2023-11-29 05:42:06,464 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 14 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:06,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 229 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 579 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2023-11-29 05:42:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 05:42:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 05:42:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 05:42:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 05:42:06,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-29 05:42:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:06,465 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 05:42:06,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.0) internal successors, (78), 40 states have internal predecessors, (78), 9 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-29 05:42:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 05:42:06,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 05:42:06,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:42:06,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:42:06,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 05:42:06,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 05:42:15,043 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 110 DAG size of output: 99 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 05:42:23,784 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification. DAG size of input: 94 DAG size of output: 79 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 05:43:01,644 WARN L293 SmtUtils]: Spent 37.83s on a formula simplification. DAG size of input: 72 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 05:43:11,191 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 102 DAG size of output: 83 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 05:43:11,388 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-11-29 05:43:11,388 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2023-11-29 05:43:11,388 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 17) the Hoare annotation is: true [2023-11-29 05:43:11,388 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2023-11-29 05:43:11,388 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-11-29 05:43:11,389 INFO L895 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse2 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~#i~2#1.offset| 0)) (.cse10 (select |#memory_int#2| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse3 (select .cse10 0)) (.cse5 (* .cse2 4))) (and .cse0 .cse1 |ULTIMATE.start_main_#t~short17#1| (<= 1 .cse2) (= .cse3 (+ .cse2 1)) (= (select .cse4 (* .cse3 4)) (select .cse4 .cse5)) .cse6 (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (= (let ((.cse8 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse7 (select .cse4 .cse8))) (store (store ((as const (Array Int Int)) 0) (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse7) .cse8 .cse7))) .cse4)) (not (= (select .cse4 (+ (- 4) .cse5)) (select .cse4 (+ 4 .cse5)))) (<= (+ 2 .cse2) |ULTIMATE.start_main_~n~0#1|) .cse9)) (let ((.cse11 (select .cse10 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse0 .cse1 |ULTIMATE.start_main_#t~short17#1| (= .cse2 0) (<= 1 .cse11) .cse6 (= (select .cse4 (* 4 .cse11)) (select .cse4 0)) (<= (+ .cse11 1) |ULTIMATE.start_main_~n~0#1|) .cse9)))) [2023-11-29 05:43:11,389 INFO L899 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2023-11-29 05:43:11,389 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0)) [2023-11-29 05:43:11,389 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-11-29 05:43:11,389 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2023-11-29 05:43:11,389 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse4 (= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse5 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse6 (= |ULTIMATE.start_main_~#j~2#1.offset| 0)) (.cse7 (= |ULTIMATE.start_finddup_~_j#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse1 (select |#memory_int#1| |ULTIMATE.start_finddup_~a#1.base|)) (.cse9 (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (let ((.cse15 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (= (let ((.cse14 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse13 (select .cse15 .cse14))) (store (store ((as const (Array Int Int)) 0) (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse13) .cse14 .cse13))) .cse15)))) (.cse10 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|)) (.cse12 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 (select .cse1 4))) (<= 2 |ULTIMATE.start_finddup_~j~1#1|) .cse2 .cse3 .cse4 .cse5 (not (= (select .cse1 8) .cse0)) (<= 3 |ULTIMATE.start_finddup_~n#1|) (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)) (and .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_finddup_~i~1#1| 0) .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_mkdup_~i~0#1_16| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_18| Int)) (and (not (= |v_ULTIMATE.start_mkdup_~i~0#1_16| |v_ULTIMATE.start_mkdup_~j~0#1_18|)) (= (select .cse1 (* |v_ULTIMATE.start_mkdup_~j~0#1_18| 4)) (select .cse1 (* |v_ULTIMATE.start_mkdup_~i~0#1_16| 4))) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_16|) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_18|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_16| 1) |ULTIMATE.start_finddup_~n#1|) (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_18| 1) |ULTIMATE.start_finddup_~n#1|))) .cse9 .cse10 .cse11 .cse12))) [2023-11-29 05:43:11,390 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2023-11-29 05:43:11,390 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-29 05:43:11,390 INFO L895 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse4 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse5 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (= |ULTIMATE.start_main_~#i~2#1.offset| 0)) (.cse2 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse7 (select |#memory_int#2| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse3 (select .cse7 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse0 .cse1 |ULTIMATE.start_main_#t~short20#1| (= .cse2 0) (<= 1 .cse3) .cse4 (= (select .cse5 (* 4 .cse3)) (select .cse5 0)) (<= (+ .cse3 1) |ULTIMATE.start_main_~n~0#1|) .cse6)) (let ((.cse8 (select .cse7 0)) (.cse9 (* .cse2 4))) (and .cse0 .cse1 |ULTIMATE.start_main_#t~short20#1| (<= 1 .cse2) (= .cse8 (+ .cse2 1)) (= (select .cse5 (* .cse8 4)) (select .cse5 .cse9)) .cse4 (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (= (let ((.cse11 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse10 (select .cse5 .cse11))) (store (store ((as const (Array Int Int)) 0) (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse10) .cse11 .cse10))) .cse5)) (not (= (select .cse5 (+ (- 4) .cse9)) (select .cse5 (+ 4 .cse9)))) (<= (+ 2 .cse2) |ULTIMATE.start_main_~n~0#1|) .cse6)))) [2023-11-29 05:43:11,390 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2023-11-29 05:43:11,390 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (<= 0 |ULTIMATE.start_mkdup_~j~0#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-11-29 05:43:11,391 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse19 (select |#memory_int#1| |ULTIMATE.start_finddup_~a#1.base|))) (let ((.cse20 (select .cse19 0))) (let ((.cse14 (not (= (select .cse19 8) .cse20))) (.cse13 (not (= .cse20 (select .cse19 4)))) (.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse15 (= |ULTIMATE.start_finddup_~j~1#1| 2)) (.cse3 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse4 (= |ULTIMATE.start_finddup_~i~1#1| 0)) (.cse5 (= |ULTIMATE.start_main_~#j~2#1.offset| 0)) (.cse6 (= |ULTIMATE.start_finddup_~_j#1.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse8 (exists ((|v_ULTIMATE.start_mkdup_~i~0#1_16| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_18| Int)) (and (not (= |v_ULTIMATE.start_mkdup_~i~0#1_16| |v_ULTIMATE.start_mkdup_~j~0#1_18|)) (= (select .cse19 (* |v_ULTIMATE.start_mkdup_~j~0#1_18| 4)) (select .cse19 (* |v_ULTIMATE.start_mkdup_~i~0#1_16| 4))) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_16|) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_18|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_16| 1) |ULTIMATE.start_finddup_~n#1|) (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_18| 1) |ULTIMATE.start_finddup_~n#1|)))) (.cse9 (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (let ((.cse18 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|))) (= (let ((.cse17 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse16 (select .cse18 .cse17))) (store (store ((as const (Array Int Int)) 0) (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse16) .cse17 .cse16))) .cse18)))) (.cse10 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse11 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|)) (.cse12 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_finddup_~j~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 (<= 2 |ULTIMATE.start_finddup_~j~1#1|) .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse15 .cse3 .cse14 (<= 3 |ULTIMATE.start_finddup_~n#1|) (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))))) [2023-11-29 05:43:11,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 05:43:11,391 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_main_#t~mem22#1| |ULTIMATE.start_main_#t~mem21#1|))) (.cse4 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |#memory_int#2| |ULTIMATE.start_main_~#j~2#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|))) (or (let ((.cse3 (select .cse5 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse0 .cse1 (= 0 (select .cse2 |ULTIMATE.start_main_~#i~2#1.offset|)) (<= 1 .cse3) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= (select .cse4 (* 4 .cse3)) (select .cse4 0)))) (let ((.cse8 (select .cse2 0))) (let ((.cse9 (+ .cse8 1)) (.cse10 (select .cse5 0)) (.cse11 (* .cse8 4))) (and .cse0 (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_16| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_26| Int)) (= .cse4 (let ((.cse7 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_16| (* |v_ULTIMATE.start_mkdup_~j~0#1_26| 4)))) (let ((.cse6 (select .cse4 .cse7))) (store (store ((as const (Array Int Int)) 0) (+ |v_ULTIMATE.start_mkdup_~a#1.offset_16| (* |v_ULTIMATE.start_mkdup_~i~0#1_24| 4)) .cse6) .cse7 .cse6))))) (<= 1 .cse8) (<= .cse9 |ULTIMATE.start_main_~n~0#1|) (= .cse10 .cse9) .cse1 (= (select .cse4 (* .cse10 4)) (select .cse4 .cse11)) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= (select .cse4 (+ (- 4) .cse11)) (select .cse4 (+ 4 .cse11)))) (= |ULTIMATE.start_main_~#i~2#1.offset| 0)))))) [2023-11-29 05:43:11,391 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2023-11-29 05:43:11,391 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-11-29 05:43:11,391 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 05:43:11,391 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2023-11-29 05:43:11,391 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_#t~mem26#1| |ULTIMATE.start_main_#t~mem25#1|)) (.cse4 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select |#memory_int#2| |ULTIMATE.start_main_~#j~2#1.base|)) (.cse2 (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|))) (or (let ((.cse3 (select .cse5 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse0 .cse1 (= 0 (select .cse2 |ULTIMATE.start_main_~#i~2#1.offset|)) (<= 1 .cse3) (<= 1 |ULTIMATE.start_main_~n~0#1|) (= (select .cse4 (* 4 .cse3)) (select .cse4 0)))) (let ((.cse9 (select .cse2 0))) (let ((.cse10 (+ .cse9 1)) (.cse6 ((as const (Array Int Int)) 0)) (.cse11 (select .cse5 0)) (.cse18 (* .cse9 4))) (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_16| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_26| Int)) (= .cse4 (let ((.cse8 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_16| (* |v_ULTIMATE.start_mkdup_~j~0#1_26| 4)))) (let ((.cse7 (select .cse4 .cse8))) (store (store .cse6 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_16| (* |v_ULTIMATE.start_mkdup_~i~0#1_24| 4)) .cse7) .cse8 .cse7))))) (<= 1 .cse9) (<= .cse10 |ULTIMATE.start_main_~n~0#1|) (= .cse11 .cse10) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse17 (select (select |#memory_int#3| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_4|) 0))) (let ((.cse12 (select |#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_13|)) (.cse13 (* .cse17 4))) (let ((.cse14 (select .cse12 (+ .cse13 |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_10| 4)))) (and (not (= (select .cse12 (+ .cse13 (- 4) |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_10|)) .cse14)) (= (let ((.cse16 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse15 (select .cse12 .cse16))) (store (store .cse6 (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse15) .cse16 .cse15))) .cse12) (= (+ .cse17 1) (select (select |#memory_int#2| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_5|) 0)) (= .cse14 (select .cse12 (+ .cse13 |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_10|)))))))) (= (select .cse4 (* .cse11 4)) (select .cse4 .cse18)) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (not (= (select .cse4 (+ (- 4) .cse18)) (select .cse4 (+ 4 .cse18)))) (= |ULTIMATE.start_main_~#i~2#1.offset| 0)))))) [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse2 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) 0)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (select |#memory_int#1| |ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (= |ULTIMATE.start_main_~#i~2#1.offset| 0)) (.cse10 (select |#memory_int#2| |ULTIMATE.start_main_~#j~2#1.base|))) (or (let ((.cse3 (select .cse10 0)) (.cse5 (* .cse2 4))) (and .cse0 .cse1 (<= 1 .cse2) (= .cse3 (+ .cse2 1)) (= (select .cse4 (* .cse3 4)) (select .cse4 .cse5)) .cse6 (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (exists ((|v_ULTIMATE.start_mkdup_~a#1.offset_15| Int) (|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (= (let ((.cse8 (+ |v_ULTIMATE.start_mkdup_~a#1.offset_15| (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4)))) (let ((.cse7 (select .cse4 .cse8))) (store (store ((as const (Array Int Int)) 0) (+ (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) |v_ULTIMATE.start_mkdup_~a#1.offset_15|) .cse7) .cse8 .cse7))) .cse4)) (not (= (select .cse4 (+ (- 4) .cse5)) (select .cse4 (+ 4 .cse5)))) (<= (+ 2 .cse2) |ULTIMATE.start_main_~n~0#1|) .cse9)) (let ((.cse11 (select .cse10 |ULTIMATE.start_main_~#j~2#1.offset|))) (and .cse0 .cse1 (= .cse2 0) (<= 1 .cse11) .cse6 (= (select .cse4 (* 4 .cse11)) (select .cse4 0)) (<= (+ .cse11 1) |ULTIMATE.start_main_~n~0#1|) .cse9)))) [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point finddup_returnLabel#1(lines 33 46) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 11) the Hoare annotation is: true [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2023-11-29 05:43:11,392 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-11-29 05:43:11,395 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:11,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:43:11,403 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-29 05:43:11,406 INFO L158 Benchmark]: Toolchain (without parser) took 203525.40ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 135.4MB in the beginning and 150.1MB in the end (delta: -14.7MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,406 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:43:11,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.96ms. Allocated memory is still 165.7MB. Free memory was 135.4MB in the beginning and 124.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.75ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,407 INFO L158 Benchmark]: Boogie Preprocessor took 46.75ms. Allocated memory is still 165.7MB. Free memory was 122.2MB in the beginning and 119.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,407 INFO L158 Benchmark]: RCFGBuilder took 398.11ms. Allocated memory is still 165.7MB. Free memory was 119.4MB in the beginning and 101.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,408 INFO L158 Benchmark]: TraceAbstraction took 202817.05ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 100.5MB in the beginning and 150.1MB in the end (delta: -49.6MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2023-11-29 05:43:11,409 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.96ms. Allocated memory is still 165.7MB. Free memory was 135.4MB in the beginning and 124.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.75ms. Allocated memory is still 165.7MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.75ms. Allocated memory is still 165.7MB. Free memory was 122.2MB in the beginning and 119.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.11ms. Allocated memory is still 165.7MB. Free memory was 119.4MB in the beginning and 101.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 202817.05ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 100.5MB in the beginning and 150.1MB in the end (delta: -49.6MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 202.8s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 62.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 64.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 41.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 3966 SdHoareTripleChecker+Invalid, 41.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3366 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3126 IncrementalHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 600 mSDtfsCounter, 3126 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1149 GetRequests, 805 SyntacticMatches, 27 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 78.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=12, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 60 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 88 PreInvPairs, 107 NumberOfFragments, 1785 HoareAnnotationTreeSize, 88 FomulaSimplifications, 2443 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1119 FormulaSimplificationTreeSizeReductionInter, 64.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 72.0s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1446 ConstructedInterpolants, 98 QuantifiedInterpolants, 19470 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1901 ConjunctsInSsa, 287 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 1119/1267 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-29 05:43:11,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/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_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:43:13,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:43:13,331 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:43:13,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:43:13,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:43:13,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:43:13,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:43:13,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:43:13,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:43:13,366 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:43:13,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:43:13,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:43:13,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:43:13,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:43:13,369 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:43:13,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:43:13,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:43:13,371 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:43:13,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:43:13,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:43:13,373 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:43:13,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:43:13,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:43:13,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:43:13,374 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:43:13,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:43:13,375 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:43:13,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:43:13,376 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:43:13,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:43:13,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:43:13,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:43:13,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:43:13,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:43:13,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:43:13,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:43:13,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:43:13,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:43:13,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:43:13,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:43:13,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:43:13,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:43:13,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:43:13,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:43:13,380 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:43:13,380 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/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_401d8f42-225f-4c39-986a-f2c9dd89d99d/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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2023-11-29 05:43:13,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:43:13,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:43:13,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:43:13,724 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:43:13,725 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:43:13,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/verifythis/duplets.c [2023-11-29 05:43:16,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:43:16,719 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:43:16,719 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c [2023-11-29 05:43:16,727 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/afe99ae87/2beb6d3248cc4239897111b12910bd97/FLAGad1e7ff5d [2023-11-29 05:43:16,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/data/afe99ae87/2beb6d3248cc4239897111b12910bd97 [2023-11-29 05:43:16,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:43:16,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:43:16,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:43:16,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:43:16,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:43:16,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:43:16" (1/1) ... [2023-11-29 05:43:16,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cacf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:16, skipping insertion in model container [2023-11-29 05:43:16,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:43:16" (1/1) ... [2023-11-29 05:43:16,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:43:16,922 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c[485,498] [2023-11-29 05:43:16,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:43:16,962 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:43:16,975 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_401d8f42-225f-4c39-986a-f2c9dd89d99d/sv-benchmarks/c/verifythis/duplets.c[485,498] [2023-11-29 05:43:16,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:43:17,004 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:43:17,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17 WrapperNode [2023-11-29 05:43:17,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:43:17,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:43:17,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:43:17,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:43:17,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,058 INFO L138 Inliner]: procedures = 23, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2023-11-29 05:43:17,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:43:17,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:43:17,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:43:17,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:43:17,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,093 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2023-11-29 05:43:17,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:43:17,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:43:17,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:43:17,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:43:17,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (1/1) ... [2023-11-29 05:43:17,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:43:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:43:17,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:43:17,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:43:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:43:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:43:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:43:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:43:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:43:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:43:17,191 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:43:17,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:43:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:43:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:43:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:43:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:43:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 05:43:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:43:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:43:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:43:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:43:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:43:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:43:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:43:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:43:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:43:17,304 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:43:17,306 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:43:17,541 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:43:17,586 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:43:17,587 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:43:17,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:43:17 BoogieIcfgContainer [2023-11-29 05:43:17,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:43:17,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:43:17,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:43:17,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:43:17,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:43:16" (1/3) ... [2023-11-29 05:43:17,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e8f059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:43:17, skipping insertion in model container [2023-11-29 05:43:17,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:43:17" (2/3) ... [2023-11-29 05:43:17,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e8f059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:43:17, skipping insertion in model container [2023-11-29 05:43:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:43:17" (3/3) ... [2023-11-29 05:43:17,595 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2023-11-29 05:43:17,621 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:43:17,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:43:17,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:43:17,666 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;@657b2193, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:43:17,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:43:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:43:17,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 05:43:17,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:17,677 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:17,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:17,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash -633346845, now seen corresponding path program 1 times [2023-11-29 05:43:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619728831] [2023-11-29 05:43:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:17,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:17,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:17,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:17,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:43:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:17,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:43:17,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:17,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:17,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619728831] [2023-11-29 05:43:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619728831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:43:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580519453] [2023-11-29 05:43:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:17,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:43:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:17,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:43:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:43:17,878 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:43:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:17,924 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2023-11-29 05:43:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:43:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-11-29 05:43:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:17,934 INFO L225 Difference]: With dead ends: 70 [2023-11-29 05:43:17,934 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 05:43:17,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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 05:43:17,941 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:17,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:43:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 05:43:17,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 05:43:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:43:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-29 05:43:17,980 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 30 [2023-11-29 05:43:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:17,980 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-29 05:43:17,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:43:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-29 05:43:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 05:43:17,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:17,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:17,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:43:18,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:18,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:18,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1840136240, now seen corresponding path program 1 times [2023-11-29 05:43:18,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098725273] [2023-11-29 05:43:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:18,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:18,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:43:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:18,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:43:18,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:18,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:18,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:18,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098725273] [2023-11-29 05:43:18,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098725273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:18,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:18,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:43:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087964069] [2023-11-29 05:43:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:18,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:43:18,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:43:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:43:18,748 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:43:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:19,347 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-11-29 05:43:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:43:19,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2023-11-29 05:43:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:19,351 INFO L225 Difference]: With dead ends: 58 [2023-11-29 05:43:19,351 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 05:43:19,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:43:19,353 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:19,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 145 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:43:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 05:43:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-29 05:43:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 05:43:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 05:43:19,365 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 30 [2023-11-29 05:43:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:19,367 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 05:43:19,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:43:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 05:43:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:43:19,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:19,369 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:19,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 05:43:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:19,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:19,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1407409120, now seen corresponding path program 1 times [2023-11-29 05:43:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388808256] [2023-11-29 05:43:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:19,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:19,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:19,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:43:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:19,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:43:19,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:19,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:19,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388808256] [2023-11-29 05:43:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388808256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:19,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:19,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:43:19,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372320709] [2023-11-29 05:43:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:43:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:43:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:43:19,716 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:43:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:19,840 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-11-29 05:43:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:43:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-29 05:43:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:19,844 INFO L225 Difference]: With dead ends: 53 [2023-11-29 05:43:19,844 INFO L226 Difference]: Without dead ends: 51 [2023-11-29 05:43:19,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:43:19,846 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:19,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 180 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:43:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-29 05:43:19,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2023-11-29 05:43:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:43:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-29 05:43:19,862 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 31 [2023-11-29 05:43:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:19,862 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-29 05:43:19,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:43:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-29 05:43:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 05:43:19,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:19,865 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:19,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:43:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:20,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:20,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:20,069 INFO L85 PathProgramCache]: Analyzing trace with hash 449686045, now seen corresponding path program 1 times [2023-11-29 05:43:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:20,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425224029] [2023-11-29 05:43:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:20,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:20,070 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:20,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:43:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:20,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 05:43:20,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:20,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:20,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425224029] [2023-11-29 05:43:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425224029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:20,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:20,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:43:20,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342824738] [2023-11-29 05:43:20,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:20,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:43:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:20,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:43:20,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:43:20,609 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:43:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:21,299 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2023-11-29 05:43:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:43:21,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-29 05:43:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:21,302 INFO L225 Difference]: With dead ends: 77 [2023-11-29 05:43:21,303 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 05:43:21,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:43:21,304 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:21,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 236 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:43:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 05:43:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-11-29 05:43:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:43:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-11-29 05:43:21,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2023-11-29 05:43:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:21,317 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-29 05:43:21,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 05:43:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-11-29 05:43:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 05:43:21,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:21,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:21,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:43:21,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:21,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:21,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash -320162031, now seen corresponding path program 1 times [2023-11-29 05:43:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:21,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951228004] [2023-11-29 05:43:21,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:21,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:21,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:21,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:43:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:21,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 05:43:21,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:43:21,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:22,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:22,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951228004] [2023-11-29 05:43:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951228004] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:43:22,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:43:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-11-29 05:43:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027971586] [2023-11-29 05:43:22,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:22,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 05:43:22,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:22,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 05:43:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:43:22,080 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:43:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:23,134 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2023-11-29 05:43:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:43:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 35 [2023-11-29 05:43:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:23,138 INFO L225 Difference]: With dead ends: 99 [2023-11-29 05:43:23,138 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 05:43:23,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:43:23,140 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 125 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:23,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 256 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:43:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 05:43:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2023-11-29 05:43:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:43:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2023-11-29 05:43:23,156 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 35 [2023-11-29 05:43:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:23,157 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2023-11-29 05:43:23,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:43:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2023-11-29 05:43:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:43:23,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:23,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:23,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 05:43:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:23,362 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:23,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:23,363 INFO L85 PathProgramCache]: Analyzing trace with hash 9167953, now seen corresponding path program 1 times [2023-11-29 05:43:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:23,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554713634] [2023-11-29 05:43:23,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:23,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:23,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:23,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:23,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:43:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:23,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:43:23,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:23,699 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 05:43:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:43:23,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:23,999 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 28 treesize of output 24 [2023-11-29 05:43:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:24,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554713634] [2023-11-29 05:43:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554713634] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:43:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-11-29 05:43:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522332033] [2023-11-29 05:43:24,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:43:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:43:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:43:24,284 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:43:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:24,797 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2023-11-29 05:43:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:43:24,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 05:43:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:24,800 INFO L225 Difference]: With dead ends: 77 [2023-11-29 05:43:24,800 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 05:43:24,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:43:24,801 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:24,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 204 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:43:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 05:43:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-11-29 05:43:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:43:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-11-29 05:43:24,817 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 38 [2023-11-29 05:43:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:24,818 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-11-29 05:43:24,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:43:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-11-29 05:43:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:43:24,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:24,820 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:24,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:43:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:25,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:25,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash 11014995, now seen corresponding path program 1 times [2023-11-29 05:43:25,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:25,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984108919] [2023-11-29 05:43:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:25,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:25,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:25,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:43:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:25,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:43:25,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:25,144 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 05:43:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:25,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:25,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984108919] [2023-11-29 05:43:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984108919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:43:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353807840] [2023-11-29 05:43:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:25,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:43:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:25,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:43:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:43:25,226 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:43:29,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:43:33,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:43:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:33,425 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2023-11-29 05:43:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:43:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-29 05:43:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:33,427 INFO L225 Difference]: With dead ends: 97 [2023-11-29 05:43:33,428 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 05:43:33,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:43:33,429 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 05:43:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 05:43:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-11-29 05:43:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:43:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2023-11-29 05:43:33,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 38 [2023-11-29 05:43:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:33,445 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2023-11-29 05:43:33,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:43:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2023-11-29 05:43:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:43:33,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:33,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:33,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 05:43:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:33,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:33,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash 161144636, now seen corresponding path program 2 times [2023-11-29 05:43:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:33,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025139535] [2023-11-29 05:43:33,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:43:33,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:33,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:33,650 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:33,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:43:33,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:43:33,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:43:33,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:43:33,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:34,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:43:34,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2023-11-29 05:43:34,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:43:34,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:43:34,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 50 [2023-11-29 05:43:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:36,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:36,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:43:36,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 345 [2023-11-29 05:43:38,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:38,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025139535] [2023-11-29 05:43:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025139535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2030814058] [2023-11-29 05:43:38,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:43:38,057 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:43:38,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:43:38,058 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:43:38,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-11-29 05:43:38,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:43:38,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:43:38,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 05:43:38,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:38,863 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2023-11-29 05:43:38,864 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 1 case distinctions, treesize of input 30 treesize of output 15 [2023-11-29 05:43:43,399 INFO L349 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2023-11-29 05:43:43,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 50 [2023-11-29 05:43:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 05:43:44,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:45,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:43:45,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 369 [2023-11-29 05:43:45,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2030814058] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:45,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:43:45,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2023-11-29 05:43:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672680154] [2023-11-29 05:43:45,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:45,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:43:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:43:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1187, Unknown=1, NotChecked=0, Total=1332 [2023-11-29 05:43:45,815 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 05:43:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:50,865 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2023-11-29 05:43:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:43:50,866 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 38 [2023-11-29 05:43:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:50,867 INFO L225 Difference]: With dead ends: 138 [2023-11-29 05:43:50,867 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 05:43:50,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=272, Invalid=1983, Unknown=1, NotChecked=0, Total=2256 [2023-11-29 05:43:50,870 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 90 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:50,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 432 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 05:43:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 05:43:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2023-11-29 05:43:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 61 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:43:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2023-11-29 05:43:50,890 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 38 [2023-11-29 05:43:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:50,890 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2023-11-29 05:43:50,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-29 05:43:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2023-11-29 05:43:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:43:50,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:50,892 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:50,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-29 05:43:51,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-11-29 05:43:51,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:43:51,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:51,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash 956566272, now seen corresponding path program 1 times [2023-11-29 05:43:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080683039] [2023-11-29 05:43:51,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:51,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:51,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:51,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:51,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:43:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:51,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 05:43:51,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:51,567 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 05:43:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:43:51,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:51,870 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 28 treesize of output 24 [2023-11-29 05:43:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:43:52,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080683039] [2023-11-29 05:43:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080683039] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:43:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-11-29 05:43:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573190012] [2023-11-29 05:43:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:43:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:43:52,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:43:52,122 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:43:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:52,720 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2023-11-29 05:43:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:43:52,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 05:43:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:52,722 INFO L225 Difference]: With dead ends: 100 [2023-11-29 05:43:52,722 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 05:43:52,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:43:52,723 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:52,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:43:52,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 05:43:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-11-29 05:43:52,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 70 states have internal predecessors, (83), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 05:43:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2023-11-29 05:43:52,738 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 45 [2023-11-29 05:43:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:52,738 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2023-11-29 05:43:52,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:43:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2023-11-29 05:43:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:43:52,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:52,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:52,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:43:52,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:52,940 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:52,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 958413314, now seen corresponding path program 1 times [2023-11-29 05:43:52,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:52,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107010364] [2023-11-29 05:43:52,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:52,942 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:52,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:43:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:53,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:43:53,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:53,065 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 05:43:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:43:53,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:43:53,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107010364] [2023-11-29 05:43:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107010364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:43:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:43:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:43:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777569554] [2023-11-29 05:43:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:43:53,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:43:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:43:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:43:53,171 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:43:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:43:53,401 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2023-11-29 05:43:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:43:53,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-29 05:43:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:43:53,403 INFO L225 Difference]: With dead ends: 121 [2023-11-29 05:43:53,403 INFO L226 Difference]: Without dead ends: 110 [2023-11-29 05:43:53,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:43:53,403 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:43:53,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:43:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-29 05:43:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-29 05:43:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 81 states have internal predecessors, (94), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:43:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-11-29 05:43:53,426 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 45 [2023-11-29 05:43:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:43:53,427 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-11-29 05:43:53,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 05:43:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-11-29 05:43:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:43:53,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:43:53,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:43:53,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:43:53,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:53,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:43:53,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:43:53,629 INFO L85 PathProgramCache]: Analyzing trace with hash 601257606, now seen corresponding path program 1 times [2023-11-29 05:43:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:43:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510719553] [2023-11-29 05:43:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:43:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:43:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:43:53,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:43:53,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:43:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:43:53,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:43:53,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:43:54,210 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 05:43:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:43:54,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:54,487 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 28 treesize of output 24 [2023-11-29 05:43:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:43:55,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:43:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510719553] [2023-11-29 05:43:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510719553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:43:55,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:43:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2023-11-29 05:43:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643815972] [2023-11-29 05:43:55,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:55,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-29 05:43:55,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-29 05:43:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:43:55,544 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:44:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:44:00,845 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2023-11-29 05:44:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-29 05:44:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 45 [2023-11-29 05:44:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:44:00,848 INFO L225 Difference]: With dead ends: 194 [2023-11-29 05:44:00,848 INFO L226 Difference]: Without dead ends: 180 [2023-11-29 05:44:00,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=713, Invalid=3069, Unknown=0, NotChecked=0, Total=3782 [2023-11-29 05:44:00,850 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 144 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:44:00,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 594 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:44:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-29 05:44:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2023-11-29 05:44:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.306930693069307) internal successors, (132), 106 states have internal predecessors, (132), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 05:44:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2023-11-29 05:44:00,875 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 45 [2023-11-29 05:44:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:44:00,875 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2023-11-29 05:44:00,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-29 05:44:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2023-11-29 05:44:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 05:44:00,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:44:00,876 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:00,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:44:01,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:44:01,077 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:44:01,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash 753234289, now seen corresponding path program 3 times [2023-11-29 05:44:01,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:01,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344656954] [2023-11-29 05:44:01,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:44:01,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:44:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:01,079 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:44:01,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:44:01,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 05:44:01,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:44:01,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 05:44:01,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:01,241 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 7 treesize of output 6 [2023-11-29 05:44:05,265 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9|))) is different from true [2023-11-29 05:44:09,301 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10|))) is different from true [2023-11-29 05:44:13,336 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11|))) is different from true [2023-11-29 05:44:13,374 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 37 treesize of output 32 [2023-11-29 05:44:14,126 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 67 treesize of output 49 [2023-11-29 05:44:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2023-11-29 05:44:14,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:44:15,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344656954] [2023-11-29 05:44:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344656954] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:44:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1252776173] [2023-11-29 05:44:15,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:44:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:44:15,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:44:15,720 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:44:15,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-11-29 05:44:15,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 05:44:15,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:44:15,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:44:15,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:16,230 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 7 treesize of output 6 [2023-11-29 05:44:20,371 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) is different from true [2023-11-29 05:44:32,842 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))))) is different from true [2023-11-29 05:44:41,191 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))))) is different from true [2023-11-29 05:44:45,677 INFO L349 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-11-29 05:44:45,677 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 2 case distinctions, treesize of input 43 treesize of output 45 [2023-11-29 05:44:48,928 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 67 treesize of output 49 [2023-11-29 05:44:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2023-11-29 05:44:49,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1252776173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:04,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:45:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2023-11-29 05:45:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049438646] [2023-11-29 05:45:04,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 05:45:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 05:45:04,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=2853, Unknown=8, NotChecked=702, Total=4032 [2023-11-29 05:45:04,433 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 05:45:08,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:45:12,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:45:16,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:45:21,494 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-29 05:45:29,793 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10|))))) is different from true [2023-11-29 05:45:38,110 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-29 05:45:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:48,444 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2023-11-29 05:45:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 05:45:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2023-11-29 05:45:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:48,446 INFO L225 Difference]: With dead ends: 197 [2023-11-29 05:45:48,446 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 05:45:48,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 90.7s TimeCoverageRelationStatistics Valid=850, Invalid=4875, Unknown=11, NotChecked=1404, Total=7140 [2023-11-29 05:45:48,449 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:48,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 320 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 3 Unknown, 490 Unchecked, 14.0s Time] [2023-11-29 05:45:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 05:45:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-11-29 05:45:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 81 states have internal predecessors, (88), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 05:45:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-11-29 05:45:48,473 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 45 [2023-11-29 05:45:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:48,473 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-11-29 05:45:48,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-29 05:45:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-11-29 05:45:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 05:45:48,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:48,474 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:48,477 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:48,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-11-29 05:45:48,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:45:48,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:45:48,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1087457780, now seen corresponding path program 1 times [2023-11-29 05:45:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:48,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970020247] [2023-11-29 05:45:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:48,877 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:48,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:45:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:48,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 05:45:48,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:49,291 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 05:45:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-29 05:45:49,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:49,652 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 28 treesize of output 24 [2023-11-29 05:45:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:45:50,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:50,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970020247] [2023-11-29 05:45:50,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970020247] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:50,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:45:50,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2023-11-29 05:45:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016641954] [2023-11-29 05:45:50,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:50,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:45:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:45:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:45:50,230 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 05:45:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:52,304 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2023-11-29 05:45:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 05:45:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 47 [2023-11-29 05:45:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:52,306 INFO L225 Difference]: With dead ends: 169 [2023-11-29 05:45:52,306 INFO L226 Difference]: Without dead ends: 158 [2023-11-29 05:45:52,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 05:45:52,308 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 79 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:52,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 377 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:45:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-29 05:45:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 122. [2023-11-29 05:45:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 90 states have internal predecessors, (97), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:45:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2023-11-29 05:45:52,330 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 47 [2023-11-29 05:45:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:52,330 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2023-11-29 05:45:52,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-29 05:45:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2023-11-29 05:45:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 05:45:52,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:52,331 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:52,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 05:45:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:52,532 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:45:52,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 733996156, now seen corresponding path program 1 times [2023-11-29 05:45:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:52,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674166588] [2023-11-29 05:45:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:52,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:52,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:52,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:52,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 05:45:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:52,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:45:52,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:52,738 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 05:45:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:45:52,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:52,825 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 28 treesize of output 24 [2023-11-29 05:45:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-29 05:45:53,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674166588] [2023-11-29 05:45:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674166588] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:53,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:45:53,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2023-11-29 05:45:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119105075] [2023-11-29 05:45:53,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:53,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:45:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:45:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:45:53,009 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:45:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:53,469 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2023-11-29 05:45:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:45:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2023-11-29 05:45:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:53,470 INFO L225 Difference]: With dead ends: 154 [2023-11-29 05:45:53,470 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 05:45:53,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:45:53,472 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:53,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:45:53,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 05:45:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2023-11-29 05:45:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 73 states have internal predecessors, (78), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:45:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-11-29 05:45:53,490 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 47 [2023-11-29 05:45:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:53,491 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-11-29 05:45:53,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:45:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-11-29 05:45:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:45:53,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:53,492 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:53,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:53,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:53,693 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:45:53,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1972974870, now seen corresponding path program 1 times [2023-11-29 05:45:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:53,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762999716] [2023-11-29 05:45:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:53,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:53,694 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:53,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 05:45:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:53,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:45:53,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:53,893 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 05:45:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:45:54,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:54,092 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 28 treesize of output 24 [2023-11-29 05:45:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 05:45:54,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:54,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762999716] [2023-11-29 05:45:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762999716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:45:54,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:45:54,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-29 05:45:54,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725741757] [2023-11-29 05:45:54,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:45:54,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:45:54,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:54,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:45:54,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:45:54,333 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:45:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:55,431 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2023-11-29 05:45:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:45:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2023-11-29 05:45:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:55,433 INFO L225 Difference]: With dead ends: 158 [2023-11-29 05:45:55,433 INFO L226 Difference]: Without dead ends: 147 [2023-11-29 05:45:55,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2023-11-29 05:45:55,434 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 91 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:55,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 315 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:45:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-29 05:45:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-11-29 05:45:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:45:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-29 05:45:55,454 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 49 [2023-11-29 05:45:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:55,454 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-29 05:45:55,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 05:45:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-29 05:45:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:45:55,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:55,455 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:55,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 05:45:55,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:55,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:45:55,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1531281429, now seen corresponding path program 1 times [2023-11-29 05:45:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519187186] [2023-11-29 05:45:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:55,657 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:55,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 05:45:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:55,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:45:55,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:55,843 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 05:45:55,849 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 05:45:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:45:56,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:56,301 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 54 treesize of output 50 [2023-11-29 05:45:56,310 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 30 treesize of output 26 [2023-11-29 05:45:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:45:56,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:45:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519187186] [2023-11-29 05:45:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519187186] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:45:56,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:45:56,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-29 05:45:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660023380] [2023-11-29 05:45:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:45:56,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:45:56,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:45:56,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:45:56,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:45:56,473 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:45:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:45:56,850 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2023-11-29 05:45:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:45:56,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2023-11-29 05:45:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:45:56,852 INFO L225 Difference]: With dead ends: 128 [2023-11-29 05:45:56,853 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 05:45:56,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:45:56,854 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:45:56,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 180 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:45:56,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 05:45:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-29 05:45:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 89 states have internal predecessors, (94), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 05:45:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2023-11-29 05:45:56,882 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 51 [2023-11-29 05:45:56,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:45:56,882 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2023-11-29 05:45:56,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:45:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2023-11-29 05:45:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 05:45:56,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:45:56,883 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:45:56,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-29 05:45:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:57,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:45:57,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:45:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1682996437, now seen corresponding path program 1 times [2023-11-29 05:45:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:45:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172367762] [2023-11-29 05:45:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:45:57,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:45:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:45:57,085 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:45:57,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 05:45:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:45:57,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 05:45:57,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:45:57,822 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 05:45:57,829 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 05:45:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 05:45:58,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:45:58,642 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 30 treesize of output 26 [2023-11-29 05:45:58,671 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 28 treesize of output 24 [2023-11-29 05:46:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-29 05:46:00,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:00,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172367762] [2023-11-29 05:46:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172367762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:00,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 33 [2023-11-29 05:46:00,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966471727] [2023-11-29 05:46:00,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:00,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:46:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:46:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:46:00,100 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 05:46:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:03,999 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2023-11-29 05:46:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-29 05:46:04,000 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 52 [2023-11-29 05:46:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:04,001 INFO L225 Difference]: With dead ends: 179 [2023-11-29 05:46:04,001 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 05:46:04,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=410, Invalid=3012, Unknown=0, NotChecked=0, Total=3422 [2023-11-29 05:46:04,003 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:04,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 420 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:46:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 05:46:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-11-29 05:46:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 89 states have internal predecessors, (93), 21 states have call successors, (21), 15 states have call predecessors, (21), 14 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 05:46:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2023-11-29 05:46:04,030 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 52 [2023-11-29 05:46:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:04,031 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2023-11-29 05:46:04,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-29 05:46:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2023-11-29 05:46:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:46:04,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:04,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:04,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 05:46:04,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:04,233 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:04,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 210876383, now seen corresponding path program 1 times [2023-11-29 05:46:04,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:04,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272924158] [2023-11-29 05:46:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:04,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:04,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:04,235 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:04,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 05:46:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:04,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 05:46:04,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:04,508 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 05:46:04,513 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 05:46:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:46:04,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:04,963 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 54 treesize of output 50 [2023-11-29 05:46:04,970 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 30 treesize of output 26 [2023-11-29 05:46:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:46:05,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:46:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272924158] [2023-11-29 05:46:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272924158] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:46:05,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:46:05,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-11-29 05:46:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415675664] [2023-11-29 05:46:05,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:46:05,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 05:46:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:46:05,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 05:46:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:46:05,245 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:46:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:06,587 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2023-11-29 05:46:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:46:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 53 [2023-11-29 05:46:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:06,590 INFO L225 Difference]: With dead ends: 179 [2023-11-29 05:46:06,590 INFO L226 Difference]: Without dead ends: 175 [2023-11-29 05:46:06,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2023-11-29 05:46:06,591 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:06,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 05:46:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-29 05:46:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2023-11-29 05:46:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 21 states have call successors, (21), 15 states have call predecessors, (21), 14 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-29 05:46:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2023-11-29 05:46:06,624 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 53 [2023-11-29 05:46:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:06,624 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2023-11-29 05:46:06,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:46:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2023-11-29 05:46:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 05:46:06,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:06,625 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:06,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 05:46:06,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:06,826 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:46:06,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:06,826 INFO L85 PathProgramCache]: Analyzing trace with hash -710336108, now seen corresponding path program 1 times [2023-11-29 05:46:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:46:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201083500] [2023-11-29 05:46:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:46:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:46:06,828 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:46:06,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401d8f42-225f-4c39-986a-f2c9dd89d99d/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 05:46:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:06,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:46:06,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:46:07,094 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 1 [2023-11-29 05:46:07,103 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 1 [2023-11-29 05:46:11,170 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) is different from true [2023-11-29 05:46:19,342 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32|)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|)))))))) is different from true [2023-11-29 05:46:31,731 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32|)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23|))))))) (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_18|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_25|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_25|)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_34|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17|))) (= (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24|)))) (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33|)))))))) is different from true [2023-11-29 05:46:44,073 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32|)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (bvmul (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_35|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_35|) (_ bv4 32)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_26|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_26|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_27| (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_20|))) (= (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_20| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_27|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_27|)))) (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_20| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_36|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_36|)))))))) is different from true [2023-11-29 05:46:52,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:46:52,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 176 [2023-11-29 05:46:52,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:46:52,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 160 [2023-11-29 05:46:55,317 INFO L349 Elim1Store]: treesize reduction 48, result has 90.9 percent of original size [2023-11-29 05:46:55,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 99 treesize of output 499 [2023-11-29 05:46:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 32 not checked. [2023-11-29 05:46:55,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:46:55,865 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 84 treesize of output 80 [2023-11-29 05:46:55,869 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 138 treesize of output 130 [2023-11-29 05:48:05,039 WARN L293 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 1405 DAG size of output: 1402 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 05:48:05,041 INFO L349 Elim1Store]: treesize reduction 12, result has 99.7 percent of original size [2023-11-29 05:48:05,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 325 case distinctions, treesize of input 518 treesize of output 4374