./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:14:38,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:14:38,322 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:14:38,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:14:38,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:14:38,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:14:38,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:14:38,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:14:38,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:14:38,354 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:14:38,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:14:38,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:14:38,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:14:38,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:14:38,357 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:14:38,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:14:38,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:14:38,358 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:14:38,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:14:38,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:14:38,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:14:38,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:14:38,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:14:38,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:14:38,372 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:14:38,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:14:38,373 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:14:38,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:14:38,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:14:38,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:14:38,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:14:38,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:14:38,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:14:38,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:14:38,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:14:38,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:14:38,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:14:38,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:14:38,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:14:38,379 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:14:38,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:14:38,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:14:38,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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2023-11-29 00:14:38,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:14:38,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:14:38,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:14:38,640 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:14:38,640 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:14:38,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-29 00:14:41,371 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:14:41,627 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:14:41,628 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/sv-benchmarks/c/heap-manipulation/dancing.i [2023-11-29 00:14:41,642 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/data/22db68723/d05cd6b7ee1a47808ff4611fe9323205/FLAG083adc51d [2023-11-29 00:14:41,653 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/data/22db68723/d05cd6b7ee1a47808ff4611fe9323205 [2023-11-29 00:14:41,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:14:41,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:14:41,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:14:41,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:14:41,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:14:41,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:14:41" (1/1) ... [2023-11-29 00:14:41,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402f6cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:41, skipping insertion in model container [2023-11-29 00:14:41,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:14:41" (1/1) ... [2023-11-29 00:14:41,705 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:14:41,844 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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2023-11-29 00:14:41,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:14:41,970 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:14:41,982 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_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2023-11-29 00:14:42,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:14:42,044 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:14:42,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42 WrapperNode [2023-11-29 00:14:42,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:14:42,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:14:42,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:14:42,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:14:42,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,089 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2023-11-29 00:14:42,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:14:42,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:14:42,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:14:42,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:14:42,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,129 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-11-29 00:14:42,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:14:42,150 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:14:42,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:14:42,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:14:42,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (1/1) ... [2023-11-29 00:14:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:14:42,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:42,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:14:42,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:14:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2023-11-29 00:14:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2023-11-29 00:14:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 00:14:42,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 00:14:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:14:42,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:14:42,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:14:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:14:42,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:14:42,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:14:42,333 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:14:42,335 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:14:42,538 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:14:42,562 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:14:42,562 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:14:42,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:42 BoogieIcfgContainer [2023-11-29 00:14:42,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:14:42,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:14:42,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:14:42,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:14:42,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:14:41" (1/3) ... [2023-11-29 00:14:42,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b442a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:14:42, skipping insertion in model container [2023-11-29 00:14:42,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:42" (2/3) ... [2023-11-29 00:14:42,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b442a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:14:42, skipping insertion in model container [2023-11-29 00:14:42,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:42" (3/3) ... [2023-11-29 00:14:42,572 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2023-11-29 00:14:42,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:14:42,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:14:42,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:14:42,650 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;@7874c0dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:14:42,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:14:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:14:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:14:42,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:42,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:42,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:42,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash -761064872, now seen corresponding path program 1 times [2023-11-29 00:14:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:42,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870460789] [2023-11-29 00:14:42,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:14:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:42,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870460789] [2023-11-29 00:14:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870460789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:42,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500418987] [2023-11-29 00:14:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:42,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:14:42,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:14:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:14:42,916 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:14:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:42,941 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2023-11-29 00:14:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:14:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2023-11-29 00:14:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:42,950 INFO L225 Difference]: With dead ends: 74 [2023-11-29 00:14:42,950 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 00:14:42,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:14:42,956 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:42,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:14:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 00:14:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 00:14:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:14:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2023-11-29 00:14:42,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 19 [2023-11-29 00:14:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2023-11-29 00:14:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:14:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2023-11-29 00:14:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:14:42,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:42,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:42,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:14:42,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:42,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash -100466027, now seen corresponding path program 1 times [2023-11-29 00:14:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:42,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804543132] [2023-11-29 00:14:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:43,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:43,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804543132] [2023-11-29 00:14:43,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804543132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:43,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589977733] [2023-11-29 00:14:43,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:43,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:14:43,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:43,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:14:43,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:43,193 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:14:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:43,243 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-11-29 00:14:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:43,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-11-29 00:14:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:43,245 INFO L225 Difference]: With dead ends: 46 [2023-11-29 00:14:43,245 INFO L226 Difference]: Without dead ends: 44 [2023-11-29 00:14:43,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:43,247 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:43,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:14:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-29 00:14:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-11-29 00:14:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.34375) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:14:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2023-11-29 00:14:43,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 20 [2023-11-29 00:14:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:43,259 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2023-11-29 00:14:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:14:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2023-11-29 00:14:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:14:43,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:43,261 INFO L195 NwaCegarLoop]: trace histogram [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 00:14:43,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:14:43,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:43,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash 763935243, now seen corresponding path program 1 times [2023-11-29 00:14:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795397633] [2023-11-29 00:14:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 00:14:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:14:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795397633] [2023-11-29 00:14:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795397633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:43,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:43,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:14:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552753807] [2023-11-29 00:14:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:43,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:14:43,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:14:43,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:14:43,392 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:14:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:43,438 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2023-11-29 00:14:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:14:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-11-29 00:14:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:43,440 INFO L225 Difference]: With dead ends: 89 [2023-11-29 00:14:43,440 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 00:14:43,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:43,443 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:43,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 138 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:14:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 00:14:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2023-11-29 00:14:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 47 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:14:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-29 00:14:43,455 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 26 [2023-11-29 00:14:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:43,455 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-29 00:14:43,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:14:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-29 00:14:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:14:43,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:43,458 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:14:43,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:14:43,458 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:43,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash -752469801, now seen corresponding path program 1 times [2023-11-29 00:14:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061387891] [2023-11-29 00:14:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:14:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 00:14:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:14:43,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061387891] [2023-11-29 00:14:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061387891] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:14:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853641540] [2023-11-29 00:14:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:43,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:43,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:43,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:14:43,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:14:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:43,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:14:43,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:43,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:14:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853641540] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:14:44,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:14:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-29 00:14:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940883087] [2023-11-29 00:14:44,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:14:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:14:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:14:44,108 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 00:14:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:44,568 INFO L93 Difference]: Finished difference Result 140 states and 199 transitions. [2023-11-29 00:14:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:14:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2023-11-29 00:14:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:44,571 INFO L225 Difference]: With dead ends: 140 [2023-11-29 00:14:44,572 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 00:14:44,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:14:44,574 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 134 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:44,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 700 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:14:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 00:14:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2023-11-29 00:14:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 55 states have internal predecessors, (69), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 00:14:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2023-11-29 00:14:44,594 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2023-11-29 00:14:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:44,594 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2023-11-29 00:14:44,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-29 00:14:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2023-11-29 00:14:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 00:14:44,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:44,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:44,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:44,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-29 00:14:44,803 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:44,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1606598365, now seen corresponding path program 1 times [2023-11-29 00:14:44,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210482330] [2023-11-29 00:14:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:14:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:14:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:14:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210482330] [2023-11-29 00:14:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210482330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:14:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696774516] [2023-11-29 00:14:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:45,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:14:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:14:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:14:45,065 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:14:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:45,135 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2023-11-29 00:14:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:14:45,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2023-11-29 00:14:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:45,137 INFO L225 Difference]: With dead ends: 78 [2023-11-29 00:14:45,137 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 00:14:45,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:14:45,138 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:45,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 298 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:14:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 00:14:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-11-29 00:14:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 61 states have internal predecessors, (74), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-29 00:14:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2023-11-29 00:14:45,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 33 [2023-11-29 00:14:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:45,156 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2023-11-29 00:14:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:14:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2023-11-29 00:14:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 00:14:45,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:45,159 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-29 00:14:45,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:14:45,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:45,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash -588926512, now seen corresponding path program 1 times [2023-11-29 00:14:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:45,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767383066] [2023-11-29 00:14:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 00:14:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:14:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:14:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767383066] [2023-11-29 00:14:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767383066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:14:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746851311] [2023-11-29 00:14:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:45,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:14:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:45,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:14:45,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:45,323 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:14:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:45,364 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2023-11-29 00:14:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-11-29 00:14:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:45,366 INFO L225 Difference]: With dead ends: 81 [2023-11-29 00:14:45,366 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 00:14:45,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:14:45,368 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:45,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:14:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 00:14:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2023-11-29 00:14:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-11-29 00:14:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2023-11-29 00:14:45,379 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 35 [2023-11-29 00:14:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:45,380 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2023-11-29 00:14:45,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:14:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2023-11-29 00:14:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:14:45,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:45,382 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2023-11-29 00:14:45,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:14:45,382 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:45,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1152947103, now seen corresponding path program 1 times [2023-11-29 00:14:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542211675] [2023-11-29 00:14:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 00:14:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 00:14:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:14:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542211675] [2023-11-29 00:14:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542211675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:45,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234036633] [2023-11-29 00:14:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:45,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:14:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:45,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:14:45,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:45,567 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:14:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:45,648 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2023-11-29 00:14:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:14:45,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-11-29 00:14:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:45,650 INFO L225 Difference]: With dead ends: 106 [2023-11-29 00:14:45,650 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 00:14:45,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:45,652 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:45,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 148 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:14:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 00:14:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 00:14:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.3) internal successors, (52), 43 states have internal predecessors, (52), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-29 00:14:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2023-11-29 00:14:45,662 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 36 [2023-11-29 00:14:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:45,662 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2023-11-29 00:14:45,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:14:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2023-11-29 00:14:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 00:14:45,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:45,664 INFO L195 NwaCegarLoop]: trace histogram [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 00:14:45,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:14:45,664 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:45,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1233966778, now seen corresponding path program 1 times [2023-11-29 00:14:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557891717] [2023-11-29 00:14:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:14:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:14:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 00:14:45,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:45,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557891717] [2023-11-29 00:14:45,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557891717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:14:45,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260538426] [2023-11-29 00:14:45,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:45,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:45,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:45,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:14:45,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:14:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:45,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-29 00:14:45,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:46,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:14:46,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:14:46,090 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:46,091 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 00:14:46,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:14:46,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:14:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:14:46,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:46,466 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 10 treesize of output 4 [2023-11-29 00:14:46,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:46,611 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-11-29 00:14:46,616 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 36 treesize of output 24 [2023-11-29 00:14:46,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:14:46,632 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-29 00:14:46,632 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 00:14:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 00:14:46,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260538426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:14:46,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:14:46,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2023-11-29 00:14:46,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643462082] [2023-11-29 00:14:46,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:46,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:14:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:14:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:14:46,669 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 00:14:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:47,797 INFO L93 Difference]: Finished difference Result 223 states and 312 transitions. [2023-11-29 00:14:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 00:14:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2023-11-29 00:14:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:47,801 INFO L225 Difference]: With dead ends: 223 [2023-11-29 00:14:47,801 INFO L226 Difference]: Without dead ends: 176 [2023-11-29 00:14:47,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 00:14:47,803 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 284 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:47,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 674 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:14:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-29 00:14:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 97. [2023-11-29 00:14:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 78 states have internal predecessors, (93), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2023-11-29 00:14:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2023-11-29 00:14:47,827 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 39 [2023-11-29 00:14:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:47,827 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2023-11-29 00:14:47,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-29 00:14:47,828 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2023-11-29 00:14:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:14:47,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:47,829 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 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] [2023-11-29 00:14:47,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:14:48,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:48,035 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:48,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:48,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1959492709, now seen corresponding path program 1 times [2023-11-29 00:14:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:48,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19852820] [2023-11-29 00:14:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:14:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:14:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:14:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19852820] [2023-11-29 00:14:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19852820] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:14:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694367824] [2023-11-29 00:14:48,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:48,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:14:48,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:14:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:48,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:14:48,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:48,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:14:48,726 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:14:48,727 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 00:14:49,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:49,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 00:14:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 00:14:49,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:49,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:49,191 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-29 00:14:49,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:49,209 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 43 treesize of output 29 [2023-11-29 00:14:49,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 00:14:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:14:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694367824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:14:49,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:14:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2023-11-29 00:14:49,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575765391] [2023-11-29 00:14:49,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:49,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 00:14:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 00:14:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2023-11-29 00:14:49,295 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 00:14:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:51,614 INFO L93 Difference]: Finished difference Result 245 states and 330 transitions. [2023-11-29 00:14:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:14:51,615 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 45 [2023-11-29 00:14:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:51,617 INFO L225 Difference]: With dead ends: 245 [2023-11-29 00:14:51,617 INFO L226 Difference]: Without dead ends: 177 [2023-11-29 00:14:51,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=661, Invalid=2531, Unknown=0, NotChecked=0, Total=3192 [2023-11-29 00:14:51,620 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 384 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:51,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 578 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:14:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-29 00:14:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 71. [2023-11-29 00:14:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 58 states have internal predecessors, (69), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2023-11-29 00:14:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2023-11-29 00:14:51,638 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 45 [2023-11-29 00:14:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:51,639 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2023-11-29 00:14:51,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 6 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 00:14:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2023-11-29 00:14:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:14:51,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:51,640 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 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] [2023-11-29 00:14:51,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:14:51,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:51,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:14:51,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1517826137, now seen corresponding path program 1 times [2023-11-29 00:14:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372647821] [2023-11-29 00:14:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:52,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:14:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:14:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:14:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 00:14:53,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:14:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372647821] [2023-11-29 00:14:53,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372647821] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:14:53,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365657200] [2023-11-29 00:14:53,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:14:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:53,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:14:53,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:14:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:53,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 00:14:53,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:53,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:14:53,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:14:53,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:14:53,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:14:53,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:14:53,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:14:54,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 00:14:54,165 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:14:54,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2023-11-29 00:14:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:14:54,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:14:54,912 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 10 treesize of output 4 [2023-11-29 00:14:55,204 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 10 treesize of output 4 [2023-11-29 00:14:55,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:55,556 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 118 [2023-11-29 00:14:55,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:55,566 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 79 [2023-11-29 00:14:55,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:55,601 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 757 treesize of output 757 [2023-11-29 00:14:55,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 457 treesize of output 423 [2023-11-29 00:14:55,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:55,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 357 treesize of output 321 [2023-11-29 00:14:55,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 256 [2023-11-29 00:14:56,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:14:56,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:14:56,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-29 00:14:56,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:14:56,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 155 [2023-11-29 00:14:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 00:14:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365657200] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:14:56,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:14:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 15] total 46 [2023-11-29 00:14:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417200964] [2023-11-29 00:14:56,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:56,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-29 00:14:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:14:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-29 00:14:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1905, Unknown=0, NotChecked=0, Total=2070 [2023-11-29 00:14:56,836 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 45 states have internal predecessors, (93), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:14:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:14:59,951 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2023-11-29 00:14:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:14:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 45 states have internal predecessors, (93), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Word has length 45 [2023-11-29 00:14:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:14:59,953 INFO L225 Difference]: With dead ends: 166 [2023-11-29 00:14:59,953 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 00:14:59,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=711, Invalid=5609, Unknown=0, NotChecked=0, Total=6320 [2023-11-29 00:14:59,958 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 207 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:14:59,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 875 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:14:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 00:14:59,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-11-29 00:14:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 71 states have internal predecessors, (82), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2023-11-29 00:14:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2023-11-29 00:14:59,975 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 45 [2023-11-29 00:14:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:14:59,975 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2023-11-29 00:14:59,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 45 states have internal predecessors, (93), 13 states have call successors, (13), 4 states have call predecessors, (13), 9 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:14:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2023-11-29 00:14:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 00:14:59,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:14:59,977 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 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] [2023-11-29 00:14:59,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:15:00,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:15:00,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:00,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:00,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1760302444, now seen corresponding path program 1 times [2023-11-29 00:15:00,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205609036] [2023-11-29 00:15:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 00:15:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205609036] [2023-11-29 00:15:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205609036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:15:00,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:15:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:15:00,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353139110] [2023-11-29 00:15:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:15:00,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:15:00,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:15:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:15:00,326 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:15:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:00,394 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2023-11-29 00:15:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:15:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2023-11-29 00:15:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:00,396 INFO L225 Difference]: With dead ends: 111 [2023-11-29 00:15:00,396 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 00:15:00,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:15:00,397 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:00,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 327 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:15:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 00:15:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2023-11-29 00:15:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 71 states have internal predecessors, (83), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2023-11-29 00:15:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2023-11-29 00:15:00,412 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 46 [2023-11-29 00:15:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:00,413 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2023-11-29 00:15:00,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:15:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2023-11-29 00:15:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-29 00:15:00,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:00,414 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:00,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:15:00,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:00,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 870967375, now seen corresponding path program 1 times [2023-11-29 00:15:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171531535] [2023-11-29 00:15:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 00:15:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171531535] [2023-11-29 00:15:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171531535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640285997] [2023-11-29 00:15:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:00,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:00,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:00,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:00,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:15:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:00,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:15:00,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:00,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 00:15:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640285997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:15:00,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:15:00,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 14 [2023-11-29 00:15:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504920019] [2023-11-29 00:15:00,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:00,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:15:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:15:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:15:00,878 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 00:15:01,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:01,115 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2023-11-29 00:15:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:15:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 48 [2023-11-29 00:15:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:01,116 INFO L225 Difference]: With dead ends: 149 [2023-11-29 00:15:01,116 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 00:15:01,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:15:01,118 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 135 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:01,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 258 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:15:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 00:15:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-11-29 00:15:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 74 states have internal predecessors, (88), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (17), 12 states have call predecessors, (17), 10 states have call successors, (17) [2023-11-29 00:15:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2023-11-29 00:15:01,132 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 48 [2023-11-29 00:15:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:01,133 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2023-11-29 00:15:01,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-29 00:15:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2023-11-29 00:15:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:15:01,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:01,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 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] [2023-11-29 00:15:01,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:15:01,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:15:01,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:01,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1970343919, now seen corresponding path program 2 times [2023-11-29 00:15:01,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:01,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660153724] [2023-11-29 00:15:01,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:01,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:15:02,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660153724] [2023-11-29 00:15:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660153724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755867502] [2023-11-29 00:15:02,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:15:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:02,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:02,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:02,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:15:02,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:15:02,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:15:02,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 00:15:02,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:02,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:02,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:02,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:02,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:02,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:03,529 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:15:03,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 46 [2023-11-29 00:15:03,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:03,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-29 00:15:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 00:15:14,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:14,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755867502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:14,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2023-11-29 00:15:14,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453983949] [2023-11-29 00:15:14,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:14,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:15:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:14,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:15:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1327, Unknown=2, NotChecked=0, Total=1482 [2023-11-29 00:15:14,606 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 38 states, 34 states have (on average 2.176470588235294) internal successors, (74), 36 states have internal predecessors, (74), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:15:20,271 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 00:15:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:23,938 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2023-11-29 00:15:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-29 00:15:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 2.176470588235294) internal successors, (74), 36 states have internal predecessors, (74), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 52 [2023-11-29 00:15:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:23,940 INFO L225 Difference]: With dead ends: 196 [2023-11-29 00:15:23,940 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 00:15:23,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=992, Invalid=7562, Unknown=2, NotChecked=0, Total=8556 [2023-11-29 00:15:23,944 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 206 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:23,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 769 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1030 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 00:15:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 00:15:23,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 69. [2023-11-29 00:15:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 55 states have internal predecessors, (64), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-29 00:15:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2023-11-29 00:15:23,961 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 52 [2023-11-29 00:15:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:23,961 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2023-11-29 00:15:23,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 2.176470588235294) internal successors, (74), 36 states have internal predecessors, (74), 11 states have call successors, (11), 5 states have call predecessors, (11), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:15:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2023-11-29 00:15:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:15:23,962 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:23,962 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:23,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:15:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 00:15:24,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:24,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -174794930, now seen corresponding path program 1 times [2023-11-29 00:15:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890410409] [2023-11-29 00:15:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:15:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890410409] [2023-11-29 00:15:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890410409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31706817] [2023-11-29 00:15:25,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:25,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:25,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:25,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:15:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:25,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 00:15:25,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:25,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:25,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:25,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:25,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 00:15:25,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:25,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:15:26,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:26,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2023-11-29 00:15:26,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:26,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:15:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-29 00:15:26,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:26,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_817 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_817) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_816 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_816) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2023-11-29 00:15:26,663 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_816 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_816) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1))) (forall ((v_ArrVal_817 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_817) |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0)))) is different from false [2023-11-29 00:15:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31706817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:26,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8] total 28 [2023-11-29 00:15:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085449882] [2023-11-29 00:15:26,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:26,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 00:15:26,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 00:15:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=785, Unknown=2, NotChecked=114, Total=992 [2023-11-29 00:15:26,683 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 28 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 28 states have internal predecessors, (77), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:15:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:28,834 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2023-11-29 00:15:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 00:15:28,835 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 28 states have internal predecessors, (77), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 55 [2023-11-29 00:15:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:28,836 INFO L225 Difference]: With dead ends: 162 [2023-11-29 00:15:28,836 INFO L226 Difference]: Without dead ends: 142 [2023-11-29 00:15:28,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=588, Invalid=3708, Unknown=2, NotChecked=258, Total=4556 [2023-11-29 00:15:28,838 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 231 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:28,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 620 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:15:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-29 00:15:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 117. [2023-11-29 00:15:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 94 states have internal predecessors, (104), 14 states have call successors, (14), 9 states have call predecessors, (14), 10 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-29 00:15:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2023-11-29 00:15:28,866 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 55 [2023-11-29 00:15:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:28,867 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2023-11-29 00:15:28,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 28 states have internal predecessors, (77), 7 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-29 00:15:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2023-11-29 00:15:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:15:28,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:28,868 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:28,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:15:29,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 00:15:29,069 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:29,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1185912180, now seen corresponding path program 1 times [2023-11-29 00:15:29,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217173184] [2023-11-29 00:15:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:15:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:30,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217173184] [2023-11-29 00:15:30,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217173184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:30,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177497693] [2023-11-29 00:15:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:30,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:30,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:30,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:15:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:30,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 00:15:30,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:30,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:30,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:30,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:30,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:30,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:31,571 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:31,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-11-29 00:15:31,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:31,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-29 00:15:32,363 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:15:32,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2023-11-29 00:15:32,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-11-29 00:15:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:15:32,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177497693] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:33,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 38 [2023-11-29 00:15:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001203161] [2023-11-29 00:15:33,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 00:15:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 00:15:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1820, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 00:15:33,329 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 38 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 10 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-29 00:15:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:36,652 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2023-11-29 00:15:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 00:15:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 10 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) Word has length 55 [2023-11-29 00:15:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:36,654 INFO L225 Difference]: With dead ends: 153 [2023-11-29 00:15:36,654 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:15:36,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=655, Invalid=4747, Unknown=0, NotChecked=0, Total=5402 [2023-11-29 00:15:36,657 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 271 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:36,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 570 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:15:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:15:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2023-11-29 00:15:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 104 states have internal predecessors, (115), 16 states have call successors, (16), 11 states have call predecessors, (16), 12 states have return successors, (22), 14 states have call predecessors, (22), 15 states have call successors, (22) [2023-11-29 00:15:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2023-11-29 00:15:36,683 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 55 [2023-11-29 00:15:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:36,683 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2023-11-29 00:15:36,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 37 states have internal predecessors, (83), 10 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-29 00:15:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2023-11-29 00:15:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 00:15:36,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:36,685 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:36,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:15:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:15:36,887 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:36,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -927746742, now seen corresponding path program 1 times [2023-11-29 00:15:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638085097] [2023-11-29 00:15:36,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:15:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638085097] [2023-11-29 00:15:37,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638085097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746630990] [2023-11-29 00:15:37,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:37,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:37,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:37,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:37,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:15:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:37,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 00:15:37,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:37,898 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:37,916 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:37,916 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2023-11-29 00:15:37,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:37,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:15:38,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 00:15:38,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:38,437 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 00:15:38,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:15:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2023-11-29 00:15:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:15:38,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746630990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:39,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12] total 34 [2023-11-29 00:15:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061363190] [2023-11-29 00:15:39,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:39,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 00:15:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 00:15:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 00:15:39,252 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 34 states, 32 states have (on average 2.5625) internal successors, (82), 34 states have internal predecessors, (82), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-29 00:15:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:41,508 INFO L93 Difference]: Finished difference Result 188 states and 214 transitions. [2023-11-29 00:15:41,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-29 00:15:41,509 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.5625) internal successors, (82), 34 states have internal predecessors, (82), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 55 [2023-11-29 00:15:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:41,510 INFO L225 Difference]: With dead ends: 188 [2023-11-29 00:15:41,510 INFO L226 Difference]: Without dead ends: 169 [2023-11-29 00:15:41,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=573, Invalid=4397, Unknown=0, NotChecked=0, Total=4970 [2023-11-29 00:15:41,512 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 272 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:41,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 537 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:15:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-29 00:15:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 122. [2023-11-29 00:15:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.1263157894736842) internal successors, (107), 97 states have internal predecessors, (107), 14 states have call successors, (14), 11 states have call predecessors, (14), 12 states have return successors, (20), 13 states have call predecessors, (20), 13 states have call successors, (20) [2023-11-29 00:15:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2023-11-29 00:15:41,535 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 55 [2023-11-29 00:15:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:41,536 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2023-11-29 00:15:41,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.5625) internal successors, (82), 34 states have internal predecessors, (82), 8 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-29 00:15:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2023-11-29 00:15:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 00:15:41,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:41,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:41,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:15:41,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 00:15:41,737 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:41,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1227125551, now seen corresponding path program 1 times [2023-11-29 00:15:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900282558] [2023-11-29 00:15:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:15:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 00:15:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 00:15:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:15:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-29 00:15:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900282558] [2023-11-29 00:15:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900282558] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642663075] [2023-11-29 00:15:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:41,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:41,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:41,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:15:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:42,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 00:15:42,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 00:15:42,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:15:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642663075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:15:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:15:42,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-11-29 00:15:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842930397] [2023-11-29 00:15:42,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:15:42,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:15:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:42,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:15:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:15:42,049 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:15:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:42,098 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2023-11-29 00:15:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:15:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2023-11-29 00:15:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:42,100 INFO L225 Difference]: With dead ends: 212 [2023-11-29 00:15:42,100 INFO L226 Difference]: Without dead ends: 128 [2023-11-29 00:15:42,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:15:42,101 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:42,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 234 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:15:42,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-29 00:15:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2023-11-29 00:15:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 95 states have internal predecessors, (105), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-29 00:15:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2023-11-29 00:15:42,131 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 61 [2023-11-29 00:15:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:42,131 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2023-11-29 00:15:42,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 00:15:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2023-11-29 00:15:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 00:15:42,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:42,132 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:42,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 00:15:42,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:15:42,333 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:42,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 467254478, now seen corresponding path program 1 times [2023-11-29 00:15:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992547303] [2023-11-29 00:15:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:15:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:15:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 00:15:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:15:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-29 00:15:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:43,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992547303] [2023-11-29 00:15:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992547303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:43,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788530993] [2023-11-29 00:15:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:43,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:43,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:43,235 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:43,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:15:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:43,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:15:43,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:43,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:15:43,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:43,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:43,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:43,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:43,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:43,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 00:15:43,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 00:15:43,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:43,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-29 00:15:43,782 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-11-29 00:15:43,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2023-11-29 00:15:43,800 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-29 00:15:43,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 1 [2023-11-29 00:15:44,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:15:44,461 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:44,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-11-29 00:15:44,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 00:15:44,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 00:15:44,912 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-29 00:15:44,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 23 [2023-11-29 00:15:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 00:15:44,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:44,996 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 34 treesize of output 28 [2023-11-29 00:15:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788530993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:45,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:45,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 25 [2023-11-29 00:15:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776428287] [2023-11-29 00:15:45,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 00:15:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 00:15:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2023-11-29 00:15:45,072 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 25 states, 25 states have (on average 3.32) internal successors, (83), 25 states have internal predecessors, (83), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-29 00:15:46,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:46,351 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2023-11-29 00:15:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 00:15:46,352 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.32) internal successors, (83), 25 states have internal predecessors, (83), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2023-11-29 00:15:46,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:46,352 INFO L225 Difference]: With dead ends: 141 [2023-11-29 00:15:46,352 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 00:15:46,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=356, Invalid=1624, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 00:15:46,354 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:46,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 346 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:15:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 00:15:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2023-11-29 00:15:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 00:15:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2023-11-29 00:15:46,375 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 67 [2023-11-29 00:15:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2023-11-29 00:15:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.32) internal successors, (83), 25 states have internal predecessors, (83), 6 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-11-29 00:15:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2023-11-29 00:15:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 00:15:46,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:46,376 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:46,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:15:46,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:15:46,576 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:46,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -115493879, now seen corresponding path program 2 times [2023-11-29 00:15:46,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:46,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330242060] [2023-11-29 00:15:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:46,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:15:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 00:15:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:46,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330242060] [2023-11-29 00:15:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330242060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:15:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:15:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:15:46,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318341173] [2023-11-29 00:15:46,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:15:46,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:15:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:15:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:15:46,687 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:15:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:46,736 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2023-11-29 00:15:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:15:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2023-11-29 00:15:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:46,737 INFO L225 Difference]: With dead ends: 75 [2023-11-29 00:15:46,737 INFO L226 Difference]: Without dead ends: 65 [2023-11-29 00:15:46,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:15:46,738 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:46,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 250 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:15:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-29 00:15:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-29 00:15:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-29 00:15:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2023-11-29 00:15:46,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 61 [2023-11-29 00:15:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:46,753 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2023-11-29 00:15:46,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 00:15:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2023-11-29 00:15:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 00:15:46,753 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:15:46,753 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:15:46,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:15:46,754 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:15:46,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:15:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash 916767562, now seen corresponding path program 3 times [2023-11-29 00:15:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:15:46,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356218701] [2023-11-29 00:15:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:15:46,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:15:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:15:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 00:15:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:15:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:15:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:15:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:15:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 00:15:47,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:15:47,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356218701] [2023-11-29 00:15:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356218701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910937001] [2023-11-29 00:15:47,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:15:47,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:47,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:15:47,527 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:15:47,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 00:15:47,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 00:15:47,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:15:47,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-29 00:15:47,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:15:47,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:47,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:47,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-11-29 00:15:47,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:47,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 00:15:48,430 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:15:48,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-11-29 00:15:48,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:48,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2023-11-29 00:15:49,100 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 00:15:49,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 46 [2023-11-29 00:15:49,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:15:49,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-11-29 00:15:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:15:49,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:15:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910937001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:15:50,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:15:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2023-11-29 00:15:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561808173] [2023-11-29 00:15:50,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:15:50,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 00:15:50,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:15:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 00:15:50,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 00:15:50,800 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 11 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 00:15:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:15:53,613 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2023-11-29 00:15:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:15:53,614 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 11 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) Word has length 62 [2023-11-29 00:15:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:15:53,614 INFO L225 Difference]: With dead ends: 71 [2023-11-29 00:15:53,614 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:15:53,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=616, Invalid=4496, Unknown=0, NotChecked=0, Total=5112 [2023-11-29 00:15:53,617 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 67 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:15:53,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 471 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:15:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:15:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:15:53,617 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 00:15:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:15:53,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-11-29 00:15:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:15:53,617 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:15:53,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 11 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (12), 9 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 00:15:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:15:53,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:15:53,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:15:53,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 00:15:53,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:15:53,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:16:11,148 WARN L293 SmtUtils]: Spent 13.40s on a formula simplification. DAG size of input: 460 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 00:16:43,654 WARN L293 SmtUtils]: Spent 32.35s on a formula simplification. DAG size of input: 417 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 00:16:44,642 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 593 600) the Hoare annotation is: true [2023-11-29 00:16:44,643 INFO L895 garLoopResultBuilder]: At program point L598(line 598) the Hoare annotation is: (let ((.cse13 (select |#memory_$Pointer$#1.offset| |is_list_containing_x_#in~l.base|)) (.cse19 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse0 (= |is_list_containing_x_#t~mem14.offset| (select .cse13 .cse19))) (.cse11 (or (not (= |is_list_containing_x_#t~mem14.offset| 0)) (not (= |is_list_containing_x_#t~mem14.base| 0)))) (.cse12 (= |is_list_containing_x_#t~mem14.base| (select (select |#memory_$Pointer$#1.base| |is_list_containing_x_#in~l.base|) .cse19)))) (and (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35| Int)) (let ((.cse3 (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35|))) (let ((.cse1 (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35|)) (.cse2 (select .cse3 0))) (or (not (= (select .cse1 4) 0)) (< .cse2 (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35|)) (not (= (select .cse1 0) 0)) (not (= (select .cse3 4) 0)) (not (= (select (select |#memory_$Pointer$#1.offset| .cse2) 4) 0)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35| (select (select |#memory_$Pointer$#1.base| .cse2) 4))) (= .cse2 0) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_35| 0)))))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| Int)) (let ((.cse5 (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8|))) (let ((.cse4 (select .cse5 0))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 0) (not (= (select (select |#memory_$Pointer$#1.base| .cse4) 4) 0)) (not (= (select .cse5 4) 0)) (< .cse4 (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_8| 2)))))) (forall ((|ULTIMATE.start_remove_~x#1.base| Int)) (let ((.cse8 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_remove_~x#1.base|))) (let ((.cse6 (select .cse8 0)) (.cse7 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_remove_~x#1.base|))) (or (not (= (select (select |#memory_$Pointer$#1.base| .cse6) 4) 0)) (not (= (select .cse7 4) 0)) (not (= 0 (select (select |#memory_$Pointer$#1.offset| .cse6) 4))) (< .cse6 (+ |ULTIMATE.start_remove_~x#1.base| 2)) (not (= (select .cse8 4) 0)) (= 0 .cse6) (not (= (select .cse7 0) 0)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|)) (.cse10 (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7|))) (or (not (= (select .cse9 4) 0)) (< (select .cse10 0) (+ |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 2)) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_7| 0) (not (= (select .cse9 0) 0)) (not (= (select .cse10 4) 0))))) (forall ((is_list_containing_x_~l.offset Int) (is_list_containing_x_~l.base Int)) (not (= (select (select |#memory_$Pointer$#1.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) |is_list_containing_x_#in~x.offset|))) (and .cse11 .cse0 .cse12)) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset) (or (and .cse11 .cse12 (or (= |is_list_containing_x_#t~mem14.offset| (select .cse13 4)) (not (= |is_list_containing_x_#in~l.offset| 0)))) (forall ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse14 (select (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_14|) 4))) (let ((.cse15 (select |#memory_$Pointer$#1.base| .cse14))) (or (< |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_14| (+ 2 .cse14)) (not (= (select .cse15 4) 0)) (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_14| (select .cse15 0))) (= .cse14 0) (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_14| 0))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_20| Int)) (let ((.cse16 (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_20|))) (let ((.cse17 (select .cse16 0)) (.cse18 (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_20|))) (or (not (= (select .cse16 4) 0)) (= .cse17 0) (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_20| 0) (not (= (select .cse18 4) 0)) (< .cse17 (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_20|)) (not (= (select .cse18 0) 0))))))) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|)))) [2023-11-29 00:16:44,644 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xFINAL(lines 593 600) no Hoare annotation was computed. [2023-11-29 00:16:44,644 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 598) no Hoare annotation was computed. [2023-11-29 00:16:44,644 INFO L899 garLoopResultBuilder]: For program point L598-1(line 598) no Hoare annotation was computed. [2023-11-29 00:16:44,644 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 596) no Hoare annotation was computed. [2023-11-29 00:16:44,644 INFO L899 garLoopResultBuilder]: For program point is_list_containing_xEXIT(lines 593 600) no Hoare annotation was computed. [2023-11-29 00:16:44,644 INFO L895 garLoopResultBuilder]: At program point L622(line 622) the Hoare annotation is: (let ((.cse2 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse4 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select .cse4 0))) (and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| .cse1) (= (select .cse0 0) 0) .cse2 (= |ULTIMATE.start_main_~x~0#1.offset| 0) .cse3 (= (select (select |#memory_$Pointer$#1.offset| .cse1) 4) 0) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= .cse1 0)) (= (select .cse4 4) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$#1.base| .cse1) 4))))) (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse2 .cse3 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)))) [2023-11-29 00:16:44,644 INFO L895 garLoopResultBuilder]: At program point L622-1(line 622) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret22#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|)) [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L622-2(line 622) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L618(line 618) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 582) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L3(line 3) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L610(lines 610 611) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L590(lines 590 591) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 592) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 616) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L615-2(lines 615 616) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:16:44,645 INFO L899 garLoopResultBuilder]: For program point L607-1(lines 607 617) no Hoare annotation was computed. [2023-11-29 00:16:44,646 INFO L895 garLoopResultBuilder]: At program point L607-3(lines 607 617) the Hoare annotation is: (let ((.cse16 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#list~0#1.base|) 4))) (let ((.cse7 (= .cse16 0))) (let ((.cse1 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse6 (not (= |ULTIMATE.start_main_~tail~0#1.base| 0))) (.cse0 (= |ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|)) (.cse5 (= |ULTIMATE.start_main_~tail~0#1.offset| 0)) (.cse8 (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|)) (.cse12 (not .cse7))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#list~0#1.base|) 4) 0) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29| Int)) (let ((.cse11 (select |#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29|))) (let ((.cse10 (select |#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29|)) (.cse9 (select .cse11 0))) (and (not (= 0 .cse9)) (= 0 (select .cse10 4)) (= (select .cse11 4) 0) (not (= |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29| 0)) (= (select .cse10 0) 0) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29|) .cse9))))) .cse5 .cse6 .cse8 .cse12) (let ((.cse17 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse14 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse13 (select |#memory_$Pointer$#1.base| .cse16)) (.cse15 (select .cse17 0))) (and .cse0 (= (select .cse13 4) 0) (= (select .cse14 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| .cse15) (= (select .cse14 0) 0) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse13 0)) .cse2 .cse3 .cse4 (<= (+ .cse16 2) |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) .cse5 (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) .cse8 (not (= .cse15 0)) (= (select .cse17 4) 0) .cse12))))))) [2023-11-29 00:16:44,647 INFO L895 garLoopResultBuilder]: At program point L607-4(lines 607 617) the Hoare annotation is: (let ((.cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse4 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse6 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#list~0#1.base|) 4))) (let ((.cse1 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (select |#memory_$Pointer$#1.base| .cse5)) (.cse2 (select .cse6 0))) (and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse0 4) 0) (= (select .cse1 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| .cse2) (= (select .cse1 0) 0) (= |ULTIMATE.start_main_~#list~0#1.base| (select .cse0 0)) .cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0) .cse4 (<= (+ .cse5 2) |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= .cse2 0)) (= (select .cse6 4) 0) (not (= .cse5 0))))) (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) .cse3 .cse4 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)))) [2023-11-29 00:16:44,647 INFO L899 garLoopResultBuilder]: For program point L620(line 620) no Hoare annotation was computed. [2023-11-29 00:16:44,647 INFO L895 garLoopResultBuilder]: At program point L620-2(line 620) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select .cse2 0))) (and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| .cse1) (= (select .cse0 0) 0) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not |ULTIMATE.start_main_#t~short21#1|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#list~0#1.base|) 4) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= .cse1 0)) (= (select .cse2 4) 0)))) [2023-11-29 00:16:44,647 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:16:44,647 INFO L899 garLoopResultBuilder]: For program point L620-3(line 620) no Hoare annotation was computed. [2023-11-29 00:16:44,647 INFO L895 garLoopResultBuilder]: At program point L620-4(line 620) the Hoare annotation is: (let ((.cse2 (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)) (.cse3 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))) (or (let ((.cse4 (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select .cse4 0))) (and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select .cse0 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| .cse1) |ULTIMATE.start_main_#t~short21#1| (= (select .cse0 0) 0) .cse2 (= |ULTIMATE.start_main_~x~0#1.offset| 0) .cse3 (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#list~0#1.base|) 4) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| 0)) (<= (+ 2 |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#list~0#1.base|) 4) 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~tail~0#1.base|) (not (= .cse1 0)) (= (select .cse4 4) 0)))) (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_#t~short21#1| .cse2 .cse3 (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|)))) [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 584) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L620-5(line 620) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 585) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 589) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L588-2(lines 588 589) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L2(lines 2 4) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 23) the Hoare annotation is: true [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 00:16:44,648 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2023-11-29 00:16:44,649 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-11-29 00:16:44,651 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:44,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:16:44,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated [2023-11-29 00:16:44,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#list~0!base][4] could not be translated [2023-11-29 00:16:44,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated [2023-11-29 00:16:44,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated [2023-11-29 00:16:44,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 : int :: ((((!(0 == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0]) && 0 == #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][4]) && #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 == 0)) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0] == 0) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 <= #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0]) could not be translated [2023-11-29 00:16:44,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated [2023-11-29 00:16:44,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~#list~0!base][4]][4] could not be translated [2023-11-29 00:16:44,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~x~0!base][4] could not be translated [2023-11-29 00:16:44,667 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][0] could not be translated [2023-11-29 00:16:44,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~x~0!base][0] could not be translated [2023-11-29 00:16:44,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~#list~0!base][4]][0] could not be translated [2023-11-29 00:16:44,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated [2023-11-29 00:16:44,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated [2023-11-29 00:16:44,669 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~x~0!base] could not be translated [2023-11-29 00:16:44,669 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][0] could not be translated [2023-11-29 00:16:44,669 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][4] could not be translated [2023-11-29 00:16:44,669 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated [2023-11-29 00:16:44,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:16:44 BoogieIcfgContainer [2023-11-29 00:16:44,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:16:44,671 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:16:44,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:16:44,671 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:16:44,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:42" (3/4) ... [2023-11-29 00:16:44,673 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:16:44,677 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2023-11-29 00:16:44,677 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-29 00:16:44,682 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 00:16:44,682 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 00:16:44,683 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:16:44,683 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:16:44,771 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:16:44,772 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:16:44,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:16:44,772 INFO L158 Benchmark]: Toolchain (without parser) took 123115.76ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 114.4MB in the beginning and 157.2MB in the end (delta: -42.8MB). Peak memory consumption was 109.1MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,773 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:16:44,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.42ms. Allocated memory is still 148.9MB. Free memory was 114.4MB in the beginning and 96.9MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.59ms. Allocated memory is still 148.9MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,774 INFO L158 Benchmark]: Boogie Preprocessor took 58.96ms. Allocated memory is still 148.9MB. Free memory was 94.9MB in the beginning and 91.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,774 INFO L158 Benchmark]: RCFGBuilder took 412.65ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 74.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,774 INFO L158 Benchmark]: TraceAbstraction took 122104.26ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 73.9MB in the beginning and 162.4MB in the end (delta: -88.5MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,774 INFO L158 Benchmark]: Witness Printer took 101.15ms. Allocated memory is still 297.8MB. Free memory was 162.4MB in the beginning and 157.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:16:44,776 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.21ms. Allocated memory is still 148.9MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.42ms. Allocated memory is still 148.9MB. Free memory was 114.4MB in the beginning and 96.9MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.59ms. Allocated memory is still 148.9MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.96ms. Allocated memory is still 148.9MB. Free memory was 94.9MB in the beginning and 91.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.65ms. Allocated memory is still 148.9MB. Free memory was 91.9MB in the beginning and 74.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 122104.26ms. Allocated memory was 148.9MB in the beginning and 297.8MB in the end (delta: 148.9MB). Free memory was 73.9MB in the beginning and 162.4MB in the end (delta: -88.5MB). Peak memory consumption was 138.5MB. Max. memory is 16.1GB. * Witness Printer took 101.15ms. Allocated memory is still 297.8MB. Free memory was 162.4MB in the beginning and 157.2MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#list~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 : int :: ((((!(0 == #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0]) && 0 == #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][4]) && #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][4] == 0) && !(v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 == 0)) && #memory_$Pointer$#1.offset[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0] == 0) && 2 + v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29 <= #memory_$Pointer$#1.base[v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_29][0]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~#list~0!base][4]][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[#memory_$Pointer$#1.base[~#list~0!base][4]][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~#list~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~x~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~x~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#list~0!base][4] could not be translated * 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: 20]: 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 122.0s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 50.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2373 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2361 mSDsluCounter, 8269 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7340 mSDsCounter, 827 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6916 IncrementalHoareTripleChecker+Invalid, 7744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 827 mSolverCounterUnsat, 929 mSDtfsCounter, 6916 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1672 GetRequests, 988 SyntacticMatches, 27 SemanticMatches, 657 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9821 ImplicationChecksByTransitivity, 36.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=15, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 467 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 164 PreInvPairs, 175 NumberOfFragments, 1090 HoareAnnotationTreeSize, 164 FomulaSimplifications, 169977 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 21915 FormulaSimplificationTreeSizeReductionInter, 49.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 36.8s InterpolantComputationTime, 1506 NumberOfCodeBlocks, 1503 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1677 ConstructedInterpolants, 195 QuantifiedInterpolants, 24402 SizeOfPredicates, 185 NumberOfNonLiveVariables, 3787 ConjunctsInSsa, 600 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 713/983 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 - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-11-29 00:16:44,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6e2d71f-a6ca-499e-a0e2-4923fb00cb28/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 Writing output log to file Ultimate.log Result: TRUE